Draw the binary search trees after each of the following operations, in that order, are performed on the rightmost binary search tree in Figure 12.4: delete 3, insert 11, delete 6, insert 17, and delete 12.

6 13 (18 (b) (c) Figure 12.4 Deleting a node: from a binary search tree. Which node is actually removed depends on how many children z has; this node is shown lightly shaded. (a) If: has no children. we just remove it. (b) If z has only one child, we splice out z. (c) If z has two children, we splice out its successor y, which has at most one child, and then replace z s key and satellite data with y's key and satellite data