1

Suppose I am making a red-black search tree, and in my right subtree, I have a black node, then a red node, and it has two black children, the black children further black childrens. As such a lemma has been made that red-black trees with $n$ internal nodes have height at most $2\log(n+1)$, would this proof still hold for such a black tree?

Raphael
  • 73,212
  • 30
  • 182
  • 400
user1675999
  • 1,037
  • 6
  • 16
  • 23

1 Answers1

6

In fact, a red-black tree can have all black nodes. In that case the tree is completely balanced and has the required bound.

Hendrik Jan
  • 31,459
  • 1
  • 54
  • 109