next up previous
Next: What is h in Up: CSE 2320: Algorithms and Previous: Properties of B-Trees

Properties of B-Trees

2. Every leaf has the same depth equal to the height of the tree.



3. The number of keys is bounded in terms of the minimum degree t $\geq$ 2.

n(x) $\geq$ t-1 (except root $\geq$ 1)
#children(x) $\geq$ t (except root $\geq$ 0), leaves = 0
n(x) $\leq$ 2t - 1
#children $\leq$ 2t (except leaves which = 0)
If n(x) = 2t - 1 then n is a .

For example, if t = 3:



Copyright © 1998 The University of Texas at Arlington