Exercise¶

You are not required to turn anything in for this exercise.

In Homeworks 5 and 6, you will implement BSTs. The implementation should be able to insert new values and optionally be able to delete values from the tree. This exercise is meant to illustrate the conceptual ideas.

Consider the array $$\left[13, 7, 19, 17, 3, 29, 5, 31, 2, 11\right].$$ With your group, at a whiteboard, do the following:

1. Draw a BST for the array
2. Create new trees by deleting the nodes with the following values
   • $13$
   • $29$
   • $31$

Note: The result of part 2 will be three different trees.