A doubly linked list is a more complicated form of linked list where each node has a pointer to the node before it and the node after it in the sequence.
A node in a doubly linked list is made up of three elements:
- Node data
- pointer for the following node in the chain (next pointer)
- identifier for the preceding node (previous pointer)