next up previous
Next: Lemma 14.1 Up: CSE 2320: Algorithms and Previous: Properties of RB Trees

Properties of RB Trees

Definition: The of a node n, denoted bh(n), is the number of black nodes (excluding n) on the path from n to a leaf, including the leaf.

bh(root) = Black Height of the tree

By property 4, bh(n) is the same regardless of the path.

Copyright © 1998 The University of Texas at Arlington