Insertion Revisited
Put data entry onto L.
- If L has enough space, done!
- Else, must split L
- Redistribute entries evenly, copy up middle key.
- insert index entry pointing to L2 into parent of L.
This can happen recursively
- To split index node, redistribute entries evenly, but push up middle key. (Contrast w/leaf splits.)
Split of root “grows” tree.
- Tree growth: gets wider or one level taller at top