Assertion: tree's node | /r/HasProperty | black
Facets:
Source sentences:
text: In particular, a black node (like a leaf node) can have a black parent; for example, every perfect binary tree that consists only of black nodes is a red-black tree.
text: To see why this is guaranteed, consider a red–black tree having b black nodes in property 5.
text: Each node is either red or black.
text: The worst case occurs when all nodes in a colored binary tree are black, the best case occurs when only a third of them are black (and the other two thirds are red nodes).
text: Property 1 (every node is either red or black) and Property 3 (all leaves are black) always holds.
text: The white node in the diagram can be either red or black, but must refer to the same color both before and after the transformation.