37     LocHeapNode* mRight;  member in LocHeapNode
41         mSize(1), mLeft(NULL), mRight(NULL), mData(&data) {}  in LocHeapNode()
78     if (mRight) {  in ~LocHeapNode()
79         delete mRight;  in ~LocHeapNode()
80         mRight = NULL;  in ~LocHeapNode()
116     } else if (NULL == mRight) {  in push()
117         mRight = &node;  in push()
118     } else if (mLeft->mSize <= mRight->mSize) {  in push()
121         mRight->push(node);  in push()
144     if (top->mLeft || top->mRight) {  in pop()
148         LocHeapNode*& subTop = (NULL == top->mLeft) ? top->mRight :  in pop()
149             ((NULL == top->mRight) ? top->mLeft :  in pop()
150              (top->mLeft->outRanks(*(top->mRight)) ? top->mLeft : top->mRight));  in pop()
182         if (!removedNode && top->mRight) {  in remove()
183             removedNode = remove(top->mRight, data);  in remove()
209     if (mRight) {  in checkNodes()
211         if (mRight->outRanks(*this) || !mRight->checkNodes()) {  in checkNodes()
215         totalSize -= mRight->mSize;  in checkNodes()