-trees fig after deleting the item containing fig after deleting the item containing that valuethe item containing in this casefrom the right subtree the result is depicted in fig deleting next causes the two sibling nodes to coalesce along with the separating item in the parent (the root in this casethe result is an empty root node as shown in fig in this casethe delete method in the -tree class must recognize this situation and update the root node pointer to point to the correct node -tree node is no longer the root node of the -tree deleting any more of the nodes simply reduces the number of items in the root node againthe delete method on -tree nodes may be implemented recursively the -tree node delete method is given the item to delete and does not need to return anything the recursive algorithm proceeds as follows if the item to delete is in the current node then we do one of two things depending on whether it is leaf node or not if the node is leaf nodethe item is deleted from the node without regard to rebalancing if the node is non-leaf nodethen the smallest valued item from the right subtree replaces the item and the smallest valued item is deleted from the right subtree if the item is not in the current node then delete is called recursively on the correct subtree after delete returnsrebalancing of the child on the path to the deleted item may be needed if the child node is out of balance first try rotating value from left this copy belongs to 'acha