INSERT:
1. Find correct leaf node L
2. Insert key in sorted order
3. If L has space → done
4. Else split L into L and L2
   → Copy up middle key to parent
   → Repeat upward if parent full

DELETE:
1. Find leaf L with entry
2. Remove entry
3. If L ≥ half-full → done
4. Try redistribute from sibling
5. Else merge L with sibling
   → Delete separator from parent

SEARCH:
1. Start at root
2. At each inner node: find
   correct child pointer
3. Follow until leaf
4. Scan leaf for key