(2) Suppose that a red-black tree contains n internal nodes. What is its maximum height? What is the time to search one value? What is the time to find the maximum value?

相關申論題

相關試卷