Data Structure (2130702)

BE | Semester-3   Summer-2019 | 06/04/2019

Q3) (a)

List the advantages of a doubly linked list over singly linked list.

  • Doubly linked list is we can traverse in any direction (Both directions), forward or reverse.
  • If we are at a node, then we can go at any node. But in singly linked list, it is not possible to reach the previous node.
  • We can delete a node with little trouble, since we have pointers to the previous and next nodes. A node on a singly linked list cannot be removed unless we have the pointer to its predecessor.