Case 2b

If child z following k in x has $\geq$ t keys:

• Find successor k' of k in subtree y
• Recursively delete k'
• Replace k by k' in x

Click mouse to advance to next frame.