A doubly linked list is a complex type of linked list in which:
2025
A doubly linked list is a complex type of linked list in which:
- A.
Each node contains a pointer to the next as well as the previous node in the sequence
- B.
Each node contains a pointer to the next node but not to the previous node
- C.
Each node contains a pointer to the previous node but not to the next node
- D.
Each node contains only data and no pointers
Attempted by 274 students.
Show answer & explanation
Correct answer: A
In a doubly linked list, each node has two pointers: one points to the next node, and the other points to the previous node, hence making it easy to navigate in both directions.