Lines Matching full:children
164 // checks relationship between a node and its children. allowRedRed means
467 // Since gp's two children are black it can become red if p is made
596 // first and last can't have two children.
649 // x has two implicit black children.
677 // p's child on its pc side. x's children are/were black. The
678 // first time through the loop they are implict children.
687 //sl and sr are s's children, which may be implicit.
696 // s's children must also be black since s is red. They can't
729 // we assumed x and x's children are black, which holds
803 // red nodes always have two black children. Then the two subtrees
