[英]minimum and maximum height of B-Tree
I see in one note that: minimum and maximum height
of B-Tree
with 1000 elements
on following conditions: 我在一个注释中看到:在以下条件下,具有
1000 elements
的B-Tree
最小和最大height
:
each blocks can save 1 to 4 records
. 每个块可以保存
1 to 4 records
。 number of internal nodes between 3 and 5
and number of children of root is 3 and 5
. between 3 and 5
的内部节点数between 3 and 5
root的子节点数是3 and 5
。
the solution is : 4<= h <=7.
解决方案是:
4<= h <=7.
how this is reach? 这是怎么到达的?
Hint: 暗示:
See: 看到:
http://en.wikipedia.org/wiki/B-tree#Best_case_and_worst_case_heights http://en.wikipedia.org/wiki/B-tree#Best_case_and_worst_case_heights
in your case [log 1000] = 7 so the worst case is 7. Why? 在你的情况下[log 1000] = 7所以最坏的情况是7.为什么?
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.