B-Tree Overview
Assume for now that keys are fixed-length and unique
A B-tree can be thought of as a generalized binary search tree
- multiple branches rather than just L or R
Trees are always perfectly balanced
Some wasted space in the nodes is tolerated