This is an experiment in externalized data structures written in Python.

The b-tree is an efficient and simple to implement algorithm that allows one node to be stored in main at a time. The previous node is written to disk, and the next node is read from it.