Description
Answer the following questions about binary search trees (BSTs). Draw the final BST after inserting elements 17, 35, 5, 38, 29, 2, 11, 9, 16, 7, 8 in that order. Draw the tree after deleting 29 from the BST in (a). Draw the tree after deleting 9 from (b). Draw the tree after deleting 5 from (c). List the elements of pre-order, in-order, and post-order traversals of the tree from (d).
