Problem: On paper, or otherwise, suppose we insert the following values in order to an empty BST: 8, 4, 12, 11, 9, 1, 13, 14, 6, 2, 10.
a) Draw the tree with root node at the top. Use a circle to represent each node. Place the node's value inside the circle and draw lines to connect any parent node to its left and/or right child.
b) List the inorder traversal for this tree. (Easy!)
c) List the postorder traversal for this tree.
d) Redraw the tree after removing 12 from the original tree.
e) Starting with the tree obtained in Part d, redraw after removing the 8