53   RED_BLACK_TREE_NODE  *Left;  member
218     Node = (Result < 0) ? Node->Left : Node->Right;  in OrderedCollectionFind()
249   while (Node->Left != NULL) {  in OrderedCollectionMin()
250     Node = Node->Left;  in OrderedCollectionMin()
321     while (Walk->Left != NULL) {  in OrderedCollectionNext()
322       Walk = Walk->Left;  in OrderedCollectionNext()
372   Walk = Node->Left;  in OrderedCollectionPrev()
386   while (Walk != NULL && Child == Walk->Left) {  in OrderedCollectionPrev()
437   LeftChild      = Pivot->Left;  in RedBlackTreeRotateRight()
440   Pivot->Left = LeftRightChild;  in RedBlackTreeRotateRight()
448     if (Pivot == Parent->Left) {  in RedBlackTreeRotateRight()
449       Parent->Left = LeftChild;  in RedBlackTreeRotateRight()
503   RightLeftChild = RightChild->Left;  in RedBlackTreeRotateLeft()
513     if (Pivot == Parent->Left) {  in RedBlackTreeRotateLeft()
514       Parent->Left = RightChild;  in RedBlackTreeRotateLeft()
519   RightChild->Left = Pivot;  in RedBlackTreeRotateLeft()
613     Tmp = (Result < 0) ? Tmp->Left : Tmp->Right;  in OrderedCollectionInsert()
646   Tmp->Left = NULL;  in OrderedCollectionInsert()
655     Parent->Left = Tmp;  in OrderedCollectionInsert()
698     if (Parent == GrandParent->Left) {  in OrderedCollectionInsert()
802       Uncle = GrandParent->Left;  in OrderedCollectionInsert()
810         if (Tmp == Parent->Left) {  in OrderedCollectionInsert()
935   OrigLeftChild  = Node->Left,  in OrderedCollectionDelete()
967       if (Node == OrigParent->Left) {  in OrderedCollectionDelete()
968         OrigParent->Left = Child;  in OrderedCollectionDelete()
990     if (ToRelink->Left == NULL) {  in OrderedCollectionDelete()
1006         ToRelink = ToRelink->Left;  in OrderedCollectionDelete()
1007       } while (ToRelink->Left != NULL);  in OrderedCollectionDelete()
1037       Parent->Left = Child;  in OrderedCollectionDelete()
1075     ToRelink->Left = OrigLeftChild;  in OrderedCollectionDelete()
1103       if (Node == OrigParent->Left) {  in OrderedCollectionDelete()
1104         OrigParent->Left = ToRelink;  in OrderedCollectionDelete()
1142       if (Child == Parent->Left) {  in OrderedCollectionDelete()
1186         LeftNephew = Sibling->Left;  in OrderedCollectionDelete()
1294         Sibling = Parent->Left;  in OrderedCollectionDelete()
1300           Sibling = Parent->Left;  in OrderedCollectionDelete()
1306         LeftNephew = Sibling->Left;  in OrderedCollectionDelete()
1317             Sibling = Parent->Left;  in OrderedCollectionDelete()
1318             LeftNephew = Sibling->Left;  in OrderedCollectionDelete()
1377     ASSERT (NodeIsNullOrBlack (Node->Left));  in RedBlackTreeRecursiveCheck()
1384   LeftHeight = RedBlackTreeRecursiveCheck (Node->Left);  in RedBlackTreeRecursiveCheck()