Insertion in Boring Text
Insert the key in its leaf
If the leaf ends up with L+1 items, overflow!
- Split the leaf into two nodes:
- original with ??(L+1)/2? items
- new one with ?(L+1)/2? items
- Add the new child to the parent
- If the parent ends up with M+1 items, overflow!
If an internal node ends up with M+1 items, overflow!
- Split the node into two nodes:
- original with ??(M+1)/2? items
- new one with ?(M+1)/2? items
- Add the new child to the parent
- If the parent ends up with M+1 items, overflow!
Split an overflowed root in two and hang the new nodes under a new root
This makes the tree deeper!