A doubly linked list is a complex type of linked list in which:
PYQ CoCubes 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 540 students.
Sign up free to check your answer
Sign up freeLoading lesson…

