Doubly Linnked List

doubly linked list is a linked list in which every node has two pointers with one data element


  • Previous Pointer
  • Next Pointer

  • Previous Pointer: This pointer of type node points to the address of node before it and in case of the first node it is assigned as NULL denoting that it doesn't point to anything.

  • Next Pointer: This pointer of type node points to the address of node after it and in case of the last node it is assigned as NULL denoting that it doesn't point to anything.

  • Head: A pointer of type node which stores the address of the first node.
  • Explanation Video from YouTube.


Implementation of doubly linked list:


Practice Problems :
  1. Inserting a Node Into a Sorted Doubly Linked List
  2. Reverse a doubly linked list

We can use linked list concept in designing web browsers where we can navigate both backward and forward from a given page

In our next article, we will study a circular linked listIf there is any error/doubt or suggestions please comment below.

Thank You for Reading.

Comments