**Definition:** The Black-Height of a node n, denoted bh(n),
is the number of black nodes (excluding n) on the path from n to a leaf,
including the leaf.

bh(root) = Black Height of the tree

By property 4, bh(n) is the same regardless of the path.