The black height of a left-leaning red-black tree is the number of black edges on the path from the root to any leaf.
What does it equal?

Question

The black height of a left-leaning red-black tree is the number of black edges on the path from the root to any leaf. What does it equal?

Answer

Half the height of the red-black tree

Answer

The height of the corresponding 2-3 tree

Answer

The number of red nodes

Answer

⌊log₂  n ⌋, where  n  is the number of keys

Crowdly