Doubly Linked Lists

At this stage, singly linked lists and operations such as insertion, deletion, and traversal have been covered. In a singly linked list, each node stores a value and a reference to the next node. This design supports traversal in the forward direction, one node at a time.

However, singly linked lists have an important limitation. As each node only stores a link to the next node, traversal is only possible in one direction. If we are currently at a node and want to return to the previous node, there is no direct way to do that. We would have to start again from the head and traverse the list until we reach the desired position.

This limitation becomes inconvenient in situations where backward movement is naturally needed. For example, if you are implementing browser history, ...