Doubly Linked Lists (DLL)

Introduction #

By now, you must have noticed a constraint that arises when dealing with singly-linked lists. For any function which does not operate at the head node, we must traverse the whole list in a loop.

While the search operation in a normal list works in the same way, access is much faster as lists allow indexing.

Furthermore, since a linked list can only be traversed in one direction, we needlessly have to keep track of previous elements.

This is where the doubly linked list comes to the rescue! ...