Doubly Linked List

overview

Remember these Terms

• Doubly linked list: Nodes linked forward and backward.
• Node: Stores data, prev, and next links.
• Head: First node; its prev is null.
• Tail: Last node; its next is null.
• Next pointer: Reference to the following node.
• Prev pointer: Reference to the preceding node.
• Traversal: Visit nodes forward or backward.
• Insertion: Add a node; update two neighbors' links.
• Deletion: Remove a node; reconnect its neighbors.