The last part works because the left-most node in the right sub-tree is guaranteed to be bigger than all nodes in the left sub-tree, smaller than all the other nodes in the right sub-tree, and have no...

WRITE THE CODE

Extracted text: The last part works because the left-most node in the right sub-tree is guaranteed to be bigger than all nodes in the left sub-tree, smaller than all the other nodes in the right sub-tree, and have no left sub-tree itself. For instance, if we delete the node with value 11 from the tree in Figure 6.1, we get the tree displayed in Figure 7.1. 12 14) 10 12 15 10 15) Figure 7.1: Example of node deletion in a binary search tree. In practice, we need to turn the above algorithm (specified in words) into a more detailed algorithm specified using the primitive binary tree operators: