notes which we normally drawl finallylet us consider the only remaining casehow to delete node having two subtrees for examplehow to delete ` 'we' like to do this with minimum amount of work and disruption to the structure of the tree the standard solution is based on this ideawe leave the node containing ` exactly where it isbut we get rid of the value and find another value to store in the ` node this value is taken from node below the ` ' nodeand it is that node that is actually removed from the tree sohere is the plan starting withl erase but keep its nodel nowwhat value can we move into the vacated node and have binary search treewellhere' how to figure it out if we choose value xthen everything in the left subtree must be smaller than everything in the right subtree must be bigger than let' suppose we're going to get from the left subtree ( is guaranteed because everything in the left subtree is smaller than everything in the right subtree what about ( )if is coming from the left subtree( says that there is unique choice for we must choose to be the largest value in the left subtree in our example is the largest value in the left subtree so if we put in the vacated node and delete it from its current position we will have bst with deleted lovely professional university