Just as a straightforward insertion algorithm might have to back up if a node on the route to in which the important was to be inserted was comprehensive, a easy approach to deletion may possibly have to back up if a node (other than the root) along the route to the place the key is to be deleted has the minimal number of keys.