Repeat Exercise 11.2, this time assuming a red/black tree and using the result of Exercise 11.5 as a starting point. Label each node with its color.

Exercise 11.2

Starting with the tree resulting from Exercise 11.1, draw the tree that results from removing (45 12 1), again using our simple implementation with no balancing mechanism.

Exercise 11.1

Draw the binary search tree that results from adding the integers (34 45 3 87 65 32 1 12 17). Assume our simple implementation with no balancing mechanism.