Project page for cs400 project A09 about B-trees.
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and
allows searches, sequential access, insertions, and deletions in logarithmic time.
The goal with b-trees is to keep the number of memory access operations low.
Here is an example of a type of b-tree called a 2-3-4 tree:
