Asking for Everything Between
Last timeKeeping It Balanced
Everything between two dates, the next one along, the ten largest. These are the questions hashing could not touch, and an ordered tree answers all of them from the shape it already has.
Hashing scattered the keys on purpose and could not answer a single question
about neighbours. The tree kept the order, and this lesson spends it.
The lesson stops here
1 more paragraph to go
You have read the opening. The rest of the argument, the problems that check whether it landed, and the lines worth keeping at the end all come with a plan.
The first lesson of every course in the library reads the whole way through, free, so you can see exactly what the rest of them are.
See the planThe contentsThis is the reading half
Starting the course gives you your own copy of it. Every idea on every page has problems standing under it, marked with a reason rather than a tick, and any sentence you do not believe can be opened and argued with. None of that can happen on a page nobody owns.
The contents