題組內容

6. [Advanced Data Structures:

(1) Given an n-key B-tree with minimum degree t, what is the upper bound of tree height? Prove the correctness of your answer.