Data Structures
This part develops the structures used throughout the rest of the book: contiguous and linked sequences, queues, maps, sets, trees, graphs, stable-handle storage, probabilistic membership, caches, rolling windows, and bounded buffers.
The goal is not memorizing APIs. It is learning to choose a representation from required operations, memory layout, ownership, capacity, and worst-case behavior.