Assertion: tree's height | /r/HasProperty | same black
Facets:
Source sentences:
text: If the two trees have the same black height, Join simply create a new node with left subtree t 1 , root k and right subtree t 2 .
text: The black height of a red–black tree is the number of black nodes in any path from the root to the leaves, which, by property 5, is constant (alternatively, it could be defined as the black depth of any leaf node).