Just as a simple insertion algorithm might have to back up a node on the path to where the key was to be inserted was full, a simple approach to deletion might have to back up ถ้า a node (other than the root) along the path to where the key is to be deleted has the minimum number of keys.