Height of a B-tree (cont.)

• Consider the right subtree of the root. Each node of this subtree has exactlyentries.

• The number of nodes on level i of this right subtree is

(the levels are numbered from 0 to h-1)

Previous slide

Next slide

Back to first slide

View graphic version