3-solutions-clrs-13.pdf

Page 1 of 7 PSU CMPSC 465 Spring 2013 Homework Solutions – Unit 3: Chapter 13 CMPSC 465 Disclaimer: This is a draft of solutions that has been prepared by the TAs and the instructor makes no guarantees that solutions presented here contain the level of detail that would be expected on an exam. Any errors or explanations you find unclear should be reported to either of the TAs for corrections first. Exercise 13.1-1 In the style of Figure 13.1(a), draw the complete binary search tree of height 3 on the keys {1, 2, …, 15}. Add the NIL leaves and color the nodes in three different ways such that the black-heights of the resulting red-black trees are 2, 3, and 4. Solution: Page 2 of 7 PSU CMPSC 465 Spring 2013 Exercise 13.1-2 Draw the red-black tree that results after TREE-INSERT is called on the tree shown in the figure below with key 36. If the inserted node is colored red, is the resulting tree a red-black tree? What if it is colored black? Solution: If the node with key 36 is inserted and colored red, the red-black tree becomes: We can see that it violates following red-black tree property: A red node in the red-black tree cannot have a red node as its child. So the resulting tree is not a red-black tree. If the node with key 36 is inserted and colored black, the red-black tree becomes: We can see that it violates following red-black tree property: For each node, all paths from the node to descendent leaves contain the same number of black nodes (e.g. consider node with key 30). So the resulting tree is not a red-black tree either. 36 36 Page 3 of 7 PSU CMPSC 465 Spring 2013 Exercise 13.1-5 Show that the longest simple path from a node x in a red-black tree to a descendant leaf has length at most twice that of the shortest simple path from node x to a descendant leaf. Proof: In the longest path, at least every other node is black. In the shortest path, at most every node is black. Since the two