symmetrically, ถ้า the child z that follows k in node x has at least t keys, then find the successor k' of k i the subtree rooted at z. Recursively delete k', and replace k by k' in x. (Finding k' and deleting it can be performed in a single downward pass.)