search trees figure incorrectly unlinking the interior node being deleted selecting the child field of the parent to change is automatically handled by the assignment performed upon return of the recursive call all we have to do is return the appropriate child link in the node being deleted ( ( unlinked figure removing an interior node ( with one child(aredirecting the link from the node' parent to its child subtreeand (bthe tree after removing removing an interior node with two children the most difficult case is when the node to be deleted has two children for examplesuppose we want to remove node from the binary search tree in figure node has two childrenboth of which are the roots of their own subtrees if we were to apply the same approach used with removing an interior node containing one childwhich child do we choose to replace the parent and what happens to the other child and its subtreefigure illustrates the result of replacing node with its right child this leaves the left subtree unlinked and thus removed from the tree it would be possible to link the left child and its subtree as the left child