COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
We can navigate in both the directions
|
|
|
It requires more space than a singly linked list
|
|
|
The insertion and deletion of a node take a bit longer
|
|
|
Implementing a doubly linked list is easier than singly linked list
|
Detailed explanation-1: -Which of the following is false about a doubly linked list? Explanation: A doubly linked list has two pointers ‘left’ and ‘right’ which enable it to traverse in either direction. Compared to singly liked list which has only a ‘next’ pointer, doubly linked list requires extra space to store this extra pointer.
Detailed explanation-2: -Advantages Of DLL: As with a singly linked list, it is the easiest data structure to implement. The traversal of this doubly linked list is bidirectional which is not possible in a singly linked list. Deletion of nodes is easy as compared to a Singly Linked List.
Detailed explanation-3: -SOLUTION-Correct answer is “ 5)The last node’s next pointer points to NULL” (It is false) Doubly Circular linked list is the data structure in which each node contain 2 pointers previous and next.
Detailed explanation-4: -Option 3: A node in a doubly linked list cannot be deleted in O(1) if a pointer to the node is given. False, In a doubly linked list we can obtain the link to the previous node in O(1) hence the deletion of the node can be done in O(1). Hence the statement is incorrect.
Detailed explanation-5: -Answer: The option that is true about a doubly linked list is option 1)-It may be either linear or circular. Explanation: Doubly linked list may be either linear or circular.