Which of the following is false about a doubly linked list?
A. We can navigate in both the directions
B. It requires more space than a singly linked list
C. The insertion and deletion of a node take a bit longer
D. Implementing a doubly linked list is easier than a singly linked list
Answer:D
Which of the following is false about a doubly linked list?
A. We can navigate in both the directions B. It requires more space than a singly linked list C. The insertion and deletion of a node take a bit longer D. Implementing a doubly linked list is easier than a singly linked list
Explanation: A doubly linked list has two pointers ‘left’ and ‘right’ which enable it to traverse in either direction. Compared to a singly-linked list which has only a ‘next’ pointer, a doubly-linked list requires extra space to store this extra pointer. Every insertion and deletion requires manipulation of two pointers, hence it takes a bit longer time. Implementing a doubly linked list involves setting both left and right pointers to correct nodes and takes more time than a singly linked list.