If child y preceding k in x has
Find predecessor k' of k in subtree rooted at y
Recursively delete k' (first two steps can be performed in one pass down the tree)
Replace k by k' in x
Click mouse to advance to next frame.