Height of Red-Black Trees
What is the minimum black-height of a node with height h?
A: a height-h node has black-height ? h/2
Theorem: A red-black tree with n internal nodes has height h ? 2 lg(n + 1)
How do you suppose we’ll prove this?
Back to first slide
View graphic version