than the node then it goes to this right child' left child (if it has one)and to this left child' left childand so onfollowing down the path of left children the last left child in this path is the successor of the original nodeas shown in figure figure finding the successor why does this workwhat we're really looking for is the smallest of the set of nodes that are larger than the original node when you go to the original node' right childall the nodes in the resulting subtree are greater than the original nodebecause this is how binary search tree is defined now we want the smallest value in this subtree as we learnedyou can find the minimum value in subtree by following the path down all the left children thusthis algorithm finds the minimum value that is greater than the original nodethis is what we mean by its successor if the right child of the original node has no left childrenthen this right child is itself the successoras shown in figure figure the right child is the successor using the workshop applet to delete node with two children generate tree with the workshop appletand pick node with two children now mentally figure out which node is its successor by going to its right child and then following down the line of this right child' left children (if it has anyyou may want to make sure the successor has no children of its own if it doesthe situation gets more complicated because entire subtrees are moved aroundrather than single node once you've chosen node to deleteclick the del button you'll be asked for the key value of the node to delete when you've specified itrepeated presses of the del button will show the red arrow searching down the tree to the designated node when the node is deletedit' replaced by its successor