Lecture Synopsis

16. Red-Black Trees

• Properties of Red-Black Trees
  • Black rule
  • Red rule
  • Path rule
• Operations
  • Search
  • Insert
  • Delete
• 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).