liveBook · Manning

Linked list

An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.

How 10 Manning books explain it

Grokking Data Structures

A linked list is a collection of nodes connected by links, allowing elements to be inserted or removed without requiring contiguous storage.

How it is used
Uses linked lists as growable alternatives to arrays and as underlying storage for containers such as bags and stacks.
How deep it goes
Works through node-based Python implementation, insertion, deletion, traversal costs, and singly, doubly, and circular variants.
Examples
Uses customer orders, a sorted-order insertion exercise, and Python node and container classes.
What you can do after
Build it from scratch in Python and choose a list variant by traversal direction, operation cost, and memory needs.

Read how Grokking Data Structures explains linked list →

Grokking Algorithms, Second Edition

A linked list is an ordered data structure whose items store links to the addresses of subsequent items rather than occupying adjacent memory locations.

How it is used
Helps choose between linked lists and arrays for storing and changing an ordered collection.
How deep it goes
Explains address links, traversal, insertion, deletion, and performance trade-offs without giving a full implementation.
Examples
Uses a to-do list, a treasure hunt, and movie seating to make memory placement and links concrete.
What you can do after
Evaluate/understand when easy insertion and deletion outweigh slow access by position and per-item pointer costs.

Read how Grokking Algorithms, Second Edition explains linked list →

Fabulous Adventures in Data Structures and Algorithms

A linked list is a sequence of nodes in which each node refers to the next node in the sequence.

How it is used
Uses an immutable linked list to examine reversal, performance analysis, and the design of an immutable stack.
How deep it goes
Builds a C# implementation, analyzes operation costs and generated equality, then replaces its error-prone empty representation in a stack.
Examples
Demonstrates reversal with five integers and shows stack branches that share an existing tail.
What you can do after
Build it from scratch as an immutable list, reverse it in linear time, and refine the representation for an immutable stack.

Read how Fabulous Adventures in Data Structures and Algorithms explains linked list →

Julia as a Second Language

A linked list is a collection data structure whose elements are connected through links rather than stored in one contiguous indexed sequence.

How it is used
Uses linked rocket stages to demonstrate collection interfaces and data-structure tradeoffs.
How deep it goes
Works through indexed traversal, termination, mutable links, and front insertion and removal.
Examples
Builds a staged rocket chain with an empty payload and a vehicle wrapper.
What you can do after
Builds a linked rocket-stage structure with front insertion and removal in Julia.

Read how Julia as a Second Language explains linked list →

Go in Action, Second Edition

A linked list is a sequence data structure whose elements are stored in nodes connected by links and whose element type can be parameterized in its generic form.

How it is used
Uses a linked list to demonstrate reusable, type-safe generic structures and interface implementations in Go.
How deep it goes
Works through node representation, collection methods, index validation, traversal, and link updates.
Examples
Demonstrates an integer list with insertion, indexed access, replacement, removal, and reversal.
What you can do after
Builds a generic linked list from scratch with collection and indexed operations.

Read how Go in Action, Second Edition explains linked list →

Functional Programming in Scala, Second Edition

A singly linked list is a sequence represented by nodes in which each nonempty node contains an element and a reference to the remaining list.

How it is used
Uses immutable lists to develop pure functions, algebraic data types, pattern matching, recursion, and structural sharing.
How deep it goes
Defines Nil and Cons, implements construction and recursive operations, and explains sharing costs; it defers alternative sequence structures.
Examples
Uses Nil, Cons, List(1,2,3,4), append, drop, dropWhile, and the init exercise to demonstrate construction and traversal.
What you can do after
Build it from scratch in Scala, construct immutable lists, pattern-match over them, and implement recursive list functions.

Read how Functional Programming in Scala, Second Edition explains linked list →

AI-Powered Developer: Build software with ChatGPT and Copilot

A linear data structure whose elements are connected through links or references to other elements.

How it is used
Uses linked lists as a realistic coding task for prompting, generating, explaining, and reviewing AI-assisted implementations.
How deep it goes
Explains nodes, links, core operations, Python structure, traversal, and in-place reversal, while emphasizing review rather than exhaustive implementation analysis.
Examples
Demonstrates Python classes, append and prepend operations, traversal output, pseudocode, and iterative reversal of links.
What you can do after
Builds and reviews a singly linked list in Python, including basic operations and an explicitly mutating reverse method.

Read how AI-Powered Developer: Build software with ChatGPT and Copilot explains linked list →

The Coder Cafe

A linked list is a sequence of nodes connected by references, allowing flexible growth and efficient insertion or removal at known positions.

How it is used
Frames linked lists as an everyday container whose organization affects operational speed, memory cost, and production choices.
How deep it goes
Explains node structure, memory layout, access, growth, insertion, deletion, and tradeoffs, without extending beyond introductory comparison.
Examples
Uses array comparisons, node references, dynamic-array implementations, and known-position insertion or deletion as concrete teaching examples.
What you can do after
Evaluate whether linked-list flexibility justifies reference overhead and slower traversal when selecting a collection for software.

Read how The Coder Cafe explains linked list →

Algorithms Every Programmer Should Know

A linked list is a sequence of elements connected by links or references to other elements.

How it is used
Frames linked lists as a flexible data-structure choice when selecting structures for algorithms.
How deep it goes
Explains nodes, sequential traversal, pointer updates, and the doubly linked variation, with Python implementations.
Examples
Uses a chain of nodes, traversal to position six, and insertion at array position three as contrasts.
What you can do after
Build a basic linked list in Python with nodes, append, and display operations.

Read how Algorithms Every Programmer Should Know explains linked list →

Elixir in Action, Third Edition

A singly linked list is a sequence of nodes in which each node refers to the next node and traversal proceeds in one direction.

How it is used
Uses singly linked lists for dynamic, variable-sized collections and sequential traversal.
How deep it goes
Explains recursive representation, construction, traversal costs, and operation trade-offs, while deferring detailed List-module reference.
Examples
Demonstrates prime-number lists, indexed access, membership, replacement, insertion, concatenation, and head-tail decomposition.
What you can do after
Apply it via List and Enum operations while recognizing when sequential access makes another data structure more suitable.

Read how Elixir in Action, Third Edition explains linked list →

Also covered in

What to know first

Related concepts

Questions about linked list

What is linked list?

An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.

Which Manning books explain linked list?

Grokking Data Structures, Grokking Algorithms, Second Edition, Fabulous Adventures in Data Structures and Algorithms, Julia as a Second Language, Go in Action, Second Edition, Functional Programming in Scala, Second Edition, AI-Powered Developer: Build software with ChatGPT and Copilot, The Coder Cafe and 2 more.

What should I know before learning linked list?

Manning books that teach linked list usually introduce array, data structure, list and performance first.

What is the difference between linked list and data locality?

An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region. Data locality is the relationship or constraint between where data is stored and where it is accessed or processed, including spatial proximity and geographic or organizational boundaries.

What kinds of linked list are there?

Kinds of linked list include doubly linked list and list.

What is linked list a kind of?

Linked list is a kind of container. A container is a logical or structural unit that holds, groups, or packages data or other elements as a single entity.

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.