Doubly Linked List
Each node points forward and back. Once you hold a node, you can remove it without walking back to the head.
Costs
| Category | Data Structure |
| Difficulty | Medium |
| Insert or delete a known node | O(1) |
| Search | O(n) |
| Extra memory versus a singly linked list | one pointer per node |
Questions
What is Doubly Linked List?
Each node points forward and back. Once you hold a node, you can remove it without walking back to the head.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.