DS – Double Linked List

Double Linked List:

  • It is a linear data structure.
  • It is bi-directional.
  • List is a collection of nodes.
  • Each node has minimum 3 fields
    • Data field
    • Pointer to previous node
    • Pointer to next node
  • Double linked list occupies more memory compare to single linked list (to maintain extra pointer field to previous node).
  • We can process elements double linked list is in more flexible way (because we can process in both the directions).

Node representation:

List representation:

  • Start pointer always pointing to first node
  • First node left link is NULL.
  • Last node right link is NULL.

Scroll to Top