Trees (BST, balancing, heaps, tries)

Six numbers arranged as a chart: one at the top, two below it, three below those, and nothing loops back. The ordered counterpart to Hashing‘s buckets, and the shape behind the B-trees in Storage Engines.

Before you start. You already have the hash table from Hashing: instant lookup, no memory of order. This lesson is the opposite trade - a shape that remembers order, at the cost of one extra comparison per step.