Q$2.$ Figure $2$ represents a binary search tree. The character represents a name of node, not a key

value of the node.

$(15$ points$)$

Draw a new binary search tree after

$(1)$ the node $C$ is deleted using TREE$-$DELETE operation which was covered in the

lecture slide.

$(2)$ With the BST from $(1),$ delete the node A using TREE$-$DELETE operation and draw

the output binary search tree.