CMSC-341, Spring 1999, Sections 101 and 201
Lecture Synopsis
16. Red-Black Trees
[Previous Lecture]
[Next Lecture]
- Properties of Red-Black Trees
- Black rule
- Red rule
- Path rule
- Operations
- Proofs
- A red-black tree with root x has at least N - 1 internal nodes.
(N is 2 to the power of bh(x), where bh(x) is the black height of x.)
- A red-black tree with n internal nodes has height less than or equal to
2 lg(n + 1).
[Previous Lecture]
[Next Lecture]
Last modified on
Tuesday April 6, 1999 (15:23:04 EDT)
by
Alan Baumgarten
email: abaumg1@cs.umbc.edu
Back up
to Spring 1999 CMSC-341 Section 1 and 2 Homepage