摘要：
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 .. 阅读全文
