Which of the following statements is not true about the doubly linked list?

Correct option is C

A doubly linked list (DLL) is a linked list in which each node contains pointers to both its previous and next nodes, allowing traversal in both directions. While DLLs have advantages, their implementation is more complex than a singly linked list (SLL) due to extra pointers and additional memory management.
Important Key Points:
1. Implementing a doubly linked list is harder than a singly linked list because:
· Each node needs two pointers (one for the previous node, one for the next).
· Insertion and deletion require more pointer adjustments.
· Memory overhead is higher compared to SLL.
2. (a) We can traverse in both directions → ✅ True: DLLs allow traversal forward and backward using both next and prev pointers.
· (b) It requires extra space → ✅ True: Each node in a DLL stores an additional pointer (prev), requiring extra memory compared to a singly linked list.
Knowledge Booster:
· Doubly linked lists are useful in applications requiring bidirectional traversal, such as undo-redo operations, navigation systems, and memory management.
· Circular doubly linked lists connect the last node to the first, forming a closed loop.
· Although DLLs require more space, they provide efficient deletion and insertion at both ends.