← Stories Writing

story

Linked Lists for Programmers

Learn linked lists from first principles: nodes, references, arrays vs linked lists, singly linked lists, doubly linked lists, and practical tradeoffs.

Hub

Linked Lists for Programmers

Learn linked lists from first principles: nodes, references, arrays vs linked lists, singly linked lists, doubly linked lists, and practical tradeoffs.

Reading Path

  1. 1 Why Linked Lists Exist

    Learn why linked lists exist, how they differ from arrays, and when reference-based sequences are useful in programming.
  2. 2 Linked List Nodes and References

    Learn the mental model behind linked lists: nodes, values, next references, head pointers, null, and how a list exists as a chain.
  3. 3 Arrays vs Linked Lists

    Compare arrays and linked lists across random access, insertion, deletion, traversal, memory overhead, and cache locality.
  4. 4 Singly Linked Lists

    Learn how singly linked lists work, including head pointers, next references, traversal, insertion, append, and deletion.
  5. 5 Doubly Linked Lists

    Learn how doubly linked lists work, why prev pointers help, and why bidirectional references make mutation more delicate.

Connections

These show why the reading path is ordered this way.