Repeat Exercise 1, this time assuming a red/black tree and using the result of Exercise 2...

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

Exercise 1

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

Exercise 3

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.

Exercise 2

Repeat Exercise 4 this time assuming a red/black tree. Label each node with its color.

Exercise 4

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.