Doubly Linked
← Back to Linked Lists
Each node stores data, a pointer to the next node, and a pointer to the previous node. Enables backward traversal and O(1) deletion of a known node without needing the predecessor. Used in LRU Cache.
← Back to Linked Lists
Each node stores data, a pointer to the next node, and a pointer to the previous node. Enables backward traversal and O(1) deletion of a known node without needing the predecessor. Used in LRU Cache.