Assertion: tree's child | /r/HasProperty | black
Facets:
value: respectively
type: DEGREE
Source sentences:
text: both children of every red node are black) holds.
text: However, the grandparent G may now violate Property 2 (the root is black) if it is the root or Property 4 (Both children of every red node are black) if it has a red parent.
text: Property 4 (both children of every red node are black) is restored in step 2.
text: All paths through the deleted node will simply pass through one fewer red node, and both the deleted node's parent and child must be black, so property 3 (all leaves are black) and property 4 (
text: both children of every red node are black) still hold.
text: “Both children of every red node are black”) and 5 (
text: Thus, we have restored Properties 4 (Both children of every red node are black) and 5 (All paths from any given node to its leaf nodes contain the same number of black nodes).
text: -1 (depending on whether the child is red or black, respectively).