2013年10月7日
Solution for 13.1-7 exercises of RB tree chapter in Introduction to Algorithms 3rd
摘要： Describe a red-black tree on n keys that realizes the largest possible ratio of red in-ternal nodes to black internal nodes. What is this ratio? What tree has the smallestpossible ratio, and what is the ratio?Solution:1. Largest possible ration Red node is as many as possible. h = [lg(k)]. Ration .. 阅读全文
posted @ 2013-10-07 12:49 charlie_xu 阅读(510) 评论(0) 推荐(0)