131       Node *Left = nullptr, *Right = nullptr;  member
174       N->Height = 1 + std::max(height(N->Left), height(N->Right));  in update()
177       if (N->Right)  in update()
178         N->MaxEnd = std::max(N->MaxEnd, N->Right->MaxEnd);  in update()
183       int32_t Balance = height(N->Right) - height(N->Left);  in rebalance()
187         return rotateLeft(N->Right, N);  in rebalance()
594   dbgs() << "  Right: " << N->Right << "\n\n";  in dump()
598   if (N->Right)  in dump()
599     dump(N->Right);  in dump()
608   order(N->Right, Seq);  in order()
619     nodesWith(N->Right, P, CheckA, Seq);  in nodesWith()
635     N->Right = add(N->Right, R);  in add()
647       N->Right = remove(N->Right, D);  in remove()
653   if (N->Left == nullptr || N->Right == nullptr)  in remove()
654     return (N->Left == nullptr) ? N->Right : N->Left;  in remove()
659   while (M->Right)  in remove()
660     M = M->Right;  in remove()
662   M->Right = N->Right;  in remove()
667   assert(Higher->Right == Lower);  in rotateLeft()
671   if (height(Lower->Left) > height(Lower->Right))  in rotateLeft()
673   assert(height(Lower->Left) <= height(Lower->Right));  in rotateLeft()
674   Higher->Right = Lower->Left;  in rotateLeft()
686   if (height(Lower->Left) < height(Lower->Right))  in rotateRight()
687     Lower = rotateLeft(Lower->Right, Lower);  in rotateRight()
688   assert(height(Lower->Left) >= height(Lower->Right));  in rotateRight()
689   Higher->Left = Lower->Right;  in rotateRight()
691   Lower->Right = Higher;  in rotateRight()