Doubly linked list
A doubly linked list is a linked sequence in which each node has references to both its predecessor and successor.
Grokking Data Structures
A doubly linked list is a linked list in which each node contains links to both its previous and next nodes, supporting traversal in both directions.
- How it is used
- Supports movement in both directions and efficient work at the list ends when backward traversal or retracing steps matters.
- How deep it goes
- Works through Python node links, insertion, search, deletion and concatenation, including edge cases and running-time tradeoffs.
- Examples
- Uses a room-navigation game, document layers, undo/redo actions and ordered task lists to illustrate backward movement and concatenation.
- What you can do after
- Build it from scratch with Python nodes and head–tail links, then choose it when bidirectional traversal justifies extra storage and maintenance.
Read how Grokking Data Structures explains doubly linked list →
Acing the Frontend Interview
A doubly linked list is a linked sequence whose nodes contain references to both their preceding and succeeding nodes.
- How it is used
- Supports LRU cache eviction by maintaining most-recently-used and least-recently-used order.
- How deep it goes
- Explains cache-order tracking and concurrency hazards but stops short of a standalone node-level implementation.
- Examples
- Uses a high-throughput API cache, head-and-tail access order, and sharded caches with Redis fallback.
- What you can do after
- Evaluate cache designs by explaining eviction order, concurrent mutation risks, and synchronization trade-offs.
Read how Acing the Frontend Interview explains doubly linked list →
Algorithms Every Programmer Should Know
A doubly linked list is a linked list whose nodes contain pointers to both the previous and next nodes.
- How it is used
- Compares flexible pointer-based updates with array access and motivates choosing structures according to a task's needs.
- How deep it goes
- Defines bidirectional links and discusses traversal, memory cost, and insertion before showing a Python append implementation.
- Examples
- Uses a three-node pointer diagram and Python code that appends nodes and displays the list forward.
- What you can do after
- Understand when two-way traversal and pointer-based updates suit a task, while accounting for extra memory.
Read how Algorithms Every Programmer Should Know explains doubly linked list →
Advanced Algorithms and Data Structures
A doubly-linked list is a linked list whose nodes contain links to both their predecessors and successors.
- How it is used
- Supports dynamic cache ordering when entries must be inserted at the front and removed efficiently from the tail.
- How deep it goes
- Explains predecessor links, tail removal, cache operations, and O(n) memory, without developing a general implementation.
- Examples
- Uses cache misses, cache hits, tail eviction, and pseudocode for insertion, lookup, updating, and eviction.
- What you can do after
- Build an LRU cache by combining a doubly linked list with a hash table and maintaining synchronized references.
Read how Advanced Algorithms and Data Structures explains doubly linked list →
What to know first
- constant timeConstant time is an asymptotic running-time bound, conventionally denoted O(1), that remains bounded independently of input size.
- linked listAn ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.
- linear time complexityLinear time complexity is an asymptotic running-time bound that grows at most proportionally to the input size, or combined input sizes, ignoring constant factors.
- referenceA reference is an indirect value, binding, or relationship that identifies or provides access to another object, value, resource, or source.
Related concepts
- linked listkind of · An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.
- listkind of · A list is an ordered collection of elements arranged in a sequence.
- concatenationimplements · Concatenation is the operation of joining ordered sequences end to end, or along a specified dimension, to form a combined sequence or structure.
Questions about doubly linked list
What is doubly linked list?
A doubly linked list is a linked sequence in which each node has references to both its predecessor and successor.
Which Manning books explain doubly linked list?
Grokking Data Structures, Acing the Frontend Interview, Algorithms Every Programmer Should Know and Advanced Algorithms and Data Structures.
What should I know before learning doubly linked list?
Manning books that teach doubly linked list usually introduce constant time, linked list, linear time complexity and reference first.
What kinds of doubly linked list are there?
Kinds of doubly linked list include sorted linked list and circular doubly linked list.
What is doubly linked list a kind of?
Doubly linked list is a kind of linked list. An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.
What are the parts of doubly linked list?
Doubly linked list includes predecessor link.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.



