36     LocHeapNode* mLeft;  member in LocHeapNode
41         mSize(1), mLeft(NULL), mRight(NULL), mData(&data) {}  in LocHeapNode()
74     if (mLeft) {  in ~LocHeapNode()
75         delete mLeft;  in ~LocHeapNode()
76         mLeft = NULL;  in ~LocHeapNode()
114     if (NULL == mLeft) {  in push()
115         mLeft = &node;  in push()
118     } else if (mLeft->mSize <= mRight->mSize) {  in push()
119         mLeft->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()
178         if (top->mLeft) {  in remove()
179             removedNode = remove(top->mLeft, data);  in remove()
200     if (mLeft) {  in checkNodes()
202         if (mLeft->outRanks(*this) || !mLeft->checkNodes()) {  in checkNodes()
206         totalSize -= mLeft->mSize;  in checkNodes()