問題詳情

6. [Advanced Data Structures:
【題組】(1) Given an n-key B-tree with minimum degree t, what is the upper bound of tree height? Prove thecorrectness of your answer.

參考答案