trees fig the tree after deleting the node containing from the tree you simply return the tree for the node containing so it ends up being linked to the node containing in fig the node containing is eliminated by making the left subtree of the node containing point at the right subtree of the node containing case this is is hardest case to implement when the value to delete is in node that has two childrenthen to delete the node we want to use another functioncall it getrightmostto get the right-most value of tree then you use this function to get the right-most value of the left subtree of the node to delete instead of deleting the nodeyou replace the value of the node with the right-most value of the left subtree then you delete the right-most value of the left subtree from the left subtree in fig the is eliminated by setting the node containing to the right-most value of the left subtree then is deleted from the left subtree fig the tree after deleting this copy belongs to 'acha