Data / Knowledge library
Linked List
Connects elements through references to the next or previous node
Why learn Linked List?
It supports local insertion without shifting a contiguous array
The problem it solves
It represents ordered data whose nodes change frequently
Where it came from
Linked List is a data structure that connects elements through references to the next or previous node. Its guarantees and tradeoffs depend on the concrete implementation and operating context.
Build your understanding
Work through these exercises in order. Try the task before opening a reference.
- Define Linked List and distinguish it from a neighboring concept.
- Choose a realistic task where Linked List is appropriate.
- Identify a failure mode caused by misusing Linked List.
- Interpret a small design or result involving Linked List.
- Explain one tradeoff or limitation of Linked List.
Documentation and sources
- NIST Dictionary of Algorithms and Data Structures (xlinux.nist.gov)