Linear structures

Sequences stored one after another: contiguous arrays and the dynamic arrays behind Python lists, linked lists in all their variants, stacks and queues. Each structure is built from scratch, traced operation by operation and measured against the built-in it resembles.

This part builds on Foundations.

2 of 4 topics ready, listed in reading order

Arrays and dynamic arraysContiguous memory and indexing, how Python lists grow, two-dimensional arrays, row-major order and cache locality.Planned

Linked listsSingly, doubly and circular lists with sentinels, insertion and deletion at every position, reversal, cycle detection and an LRU cache.ReadyStacksArray and linked stacks, balanced brackets, conversion between infix, prefix and postfix, postfix evaluation and the call stack.Ready

Queues and dequesCircular buffers, linked queues, double-ended queues and simulations driven by a queue.Planned