Doubly Linked Lists

A common variation of linked list is the doubly linked list. In this version, each node has both a next pointer as well as a pointer to the previous node, often called prev pointer. This makes it possible to traverse through the list in both directions, which makes some algorithms (such as deleting a node) easier to implement.

Watch the following video to learn more about doubly-linked lists:

Note: there is a brief mention in the video of how to create a doubly linked list node in the C programming language using a struct. You can ignore this segment and just focus on the general ideas presented about doubly linked lists.