Just as a simple insertion algorithm may possibly have to back up if a node on the route to exactly where the important was to be inserted was full, a basic technique to deletion might have to again up if a node (other than the root) alongside the path to exactly where the critical is to be deleted has the minimum range of keys.