Height of a B-tree (cont.)
Let h be the maximum height of a B-tree with N entries. Let N’ be the minimum number of entries of a B-tree of height h (among all B-trees of height h). Let T’ be such a B-tree.
The B-tree T’, which has N’ entries, has a special shape. Thanks to this shape we will be able to relate h and N’, and in the end h and N.