What is a Two-Way or Doubly Linked List?
A two-way or doubly linked list is a more complex type of linked list which contains a pointer to the next as well as the previous node in the sequence. This allows for more flexibility and operations than a simple linked list.
In a doubly linked list, each element has three parts:
- Data: The information you’re storing.
- Next Pointer: The address of the next element.
- Previous Pointer: The address of the previous element.
This setup allows you to move forward to the next item or backward to the previous one, which is why it’s called “two-way” or “doubly” linked.
Is two way linked list and doubly linked list same?
Yes, a two-way linked list and a doubly linked list are the same. Both terms refer to a type of linked list where each node contains a reference to the next node as well as the previous node in the sequence.
The term “two-way” emphasizes the ability to move in both directions through the list, while “doubly” highlights that there are two links per item. Despite the different names, they refer to the same structure.