binary trees to find successor of this node go to right child successor no left child 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 successorby 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 after 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 let' assume you use the workshop applet to delete the node with key from the example shown earlier in figure the red arrow will go from the root at to then will be replaced by java code to find the successor here' some code for method getsuccessor()which returns the successor of the node specified as its delnode argument (this routine assumes that delnode does indeed have right childbut we know this is true because we've already determined that the node to be deleted has two children /returns node with next-highest value after delnode /goes to right childthen right child' left descendants private node getsuccessor(node delnodenode successorparent delnode