Suppose that the keys {1, 2, ..., n} are inserted into an empty B-tree with minimum degree 2. How many nodes does the final B-tree have?
假设关键字{1, 2, ..., n}被插入到一个最小度数为2的空B树中。最终B树有多少个结点?
请写出求解过程。
...全文
70418打赏收藏
算法导论(第二版) 18.2-4
Suppose that the keys {1, 2, ..., n} are inserted into an empty B-tree with minimum degree 2. How many nodes does the final B-tree have? 假设关键字{1, 2, ..., n}被插入到一个最小度数为2的空B树中。最终B树有多少个结点? 请写出求解过程。