131       Node *Left = nullptr, *Right = nullptr;  member
174       N->Height = 1 + std::max(height(N->Left), height(N->Right));  in update()
175       if (N->Left)  in update()
176         N->MaxEnd = std::max(N->MaxEnd, N->Left->MaxEnd);  in update()
183       int32_t Balance = height(N->Right) - height(N->Left);  in rebalance()
185         return rotateRight(N->Left, N);  in rebalance()
593   dbgs() << "  Left: " << N->Left << '\n';  in dump()
596   if (N->Left)  in dump()
597     dump(N->Left);  in dump()
606   order(N->Left, Seq);  in order()
615   nodesWith(N->Left, P, CheckA, Seq);  in nodesWith()
633     N->Left = add(N->Left, R);  in add()
645       N->Left = remove(N->Left, D);  in remove()
653   if (N->Left == nullptr || N->Right == nullptr)  in remove()
654     return (N->Left == nullptr) ? N->Right : N->Left;  in remove()
658   Node *M = N->Left;  in remove()
661   M->Left = remove(N->Left, M);  in remove()
671   if (height(Lower->Left) > height(Lower->Right))  in rotateLeft()
672     Lower = rotateRight(Lower->Left, Lower);  in rotateLeft()
673   assert(height(Lower->Left) <= height(Lower->Right));  in rotateLeft()
674   Higher->Right = Lower->Left;  in rotateLeft()
676   Lower->Left = Higher;  in rotateLeft()
682   assert(Higher->Left == Lower);  in rotateRight()
686   if (height(Lower->Left) < height(Lower->Right))  in rotateRight()
688   assert(height(Lower->Left) >= height(Lower->Right));  in rotateRight()
689   Higher->Left = Lower->Right;  in rotateRight()