Best Case and Worst Case Heights
Let h be the height of the classic B-tree. Let n > 0 be the number of entries in the tree. Let m be the maximum number of children a node can have. Each node can have at most m−1 keys.
It can be shown (by induction for example) that a B-tree of height h with all its keys completely filled has keys. Hence, the best case height of a B-tree is:
Let d be the minimum number of children an internal (non-root) node can have. For an ordinary B-tree, d=⌈m/2⌉.
The worst case height of a B-tree is:
Comer (1979, p. 127) and Cormen et al. (year, pp. 383–384) give a slightly different expression for the worst case height (perhaps because the root node is considered to have height 0).
Read more about this topic: B-tree
Famous quotes containing the words case, worst and/or heights:
“Massachusetts sat waiting Mr. Loring’s decision.... It was really the trial of Massachusetts. Every moment that she hesitated to set this man free, every moment that she now hesitates to atone for her crime, she is convicted. The commissioner on her case is God; not Edward G. God, but simply God.”
—Henry David Thoreau (1817–1862)
“The books we think we ought to read are poky, dull, and dry;
The books that we would like to read we are ashamed to buy;
The books that people talk about we never can recall;
And the books that people give us, oh, they’re the worst of all.”
—Carolyn Wells (1870–1942)
“This monument, so imposing and tasteful, fittingly typifies the grand and symmetrical character of him in whose honor it has been builded. His was “the arduous greatness of things done.” No friendly hands constructed and placed for his ambition a ladder upon which he might climb. His own brave hands framed and nailed the cleats upon which he climbed to the heights of public usefulness and fame.”
—Benjamin Harrison (1833–1901)