Lines Matching refs:parent
34 parent = NULL;
59 else if (parent) {
60 return parent->leaf(this, s);
64 if (parent) {
65 return parent->leaf(this, s);
86 if (parent)
87 return parent->RestoreBalances (this, racine);
97 if (parent)
98 return parent->RestoreBalances (this, racine);
120 AVLTree *r = parent;
122 a->parent = b;
126 e->parent = a;
129 d->parent = a;
132 c->parent = b;
133 b->parent = r;
157 AVLTree *r = parent;
159 a->parent = d;
161 b->parent = d;
165 g->parent = a;
168 e->parent = a;
171 c->parent = b;
174 f->parent = b;
176 d->parent = r;
224 AVLTree *r = parent;
228 a->parent = b;
232 e->parent = a;
235 d->parent = a;
238 c->parent = b;
239 b->parent = r;
263 a->parent = d;
265 b->parent = d;
269 g->parent = a;
272 e->parent = a;
275 c->parent = b;
278 f->parent = b;
280 d->parent = r;
322 if (parent)
324 if (this == parent->child[RIGHT])
325 return parent->RestoreBalances (1, racine);
326 if (this == parent->child[LEFT])
327 return parent->RestoreBalances (-1, racine);
341 AVLTree *r = parent;
354 a->parent = e;
356 g->parent = e;
358 b->parent = a;
360 f->parent = a;
361 e->parent = r;
389 a->parent = e;
391 g->parent = e;
393 b->parent = a;
395 f->parent = a;
396 e->parent = r;
427 b->parent = a;
429 i->parent = a;
431 g->parent = e;
433 j->parent = e;
435 a->parent = f;
437 e->parent = f;
438 f->parent = r;
500 AVLTree *r = parent;
513 a->parent = e;
515 g->parent = e;
517 b->parent = a;
519 f->parent = a;
520 e->parent = r;
548 a->parent = e;
550 g->parent = e;
552 b->parent = a;
554 f->parent = a;
555 e->parent = r;
586 b->parent = a;
588 i->parent = a;
590 g->parent = e;
592 j->parent = e;
594 a->parent = f;
596 e->parent = f;
597 f->parent = r;
640 if (parent)
642 if (this == parent->child[RIGHT])
643 return parent->RestoreBalances (1, racine);
644 if (this == parent->child[LEFT])
645 return parent->RestoreBalances (-1, racine);
689 child[RIGHT]->parent = newMe;
690 newMe->parent = parent;
691 if (parent)
693 if (parent->child[LEFT] == this)
694 parent->child[LEFT] = newMe;
695 if (parent->child[RIGHT] == this)
696 parent->child[RIGHT] = newMe;
701 AVLTree *oParent = newMe->parent;
707 newMe->child[LEFT]->parent = oParent;
709 newMe->parent = parent;
712 if (parent)
714 if (parent->child[LEFT] == this)
715 parent->child[LEFT] = newMe;
716 if (parent->child[RIGHT] == this)
717 parent->child[RIGHT] = newMe;
720 child[LEFT]->parent = newMe;
722 child[RIGHT]->parent = newMe;
730 startNode = parent;
732 if (parent)
734 if (this == parent->child[LEFT])
736 if (this == parent->child[RIGHT])
739 if (parent)
741 if (parent->child[LEFT] == this)
742 parent->child[LEFT] = child[LEFT];
743 if (parent->child[RIGHT] == this)
744 parent->child[RIGHT] = child[LEFT];
746 if (child[LEFT]->parent == this)
747 child[LEFT]->parent = parent;
753 startNode = parent;
755 if (parent)
757 if (this == parent->child[LEFT])
759 if (this == parent->child[RIGHT])
762 if (parent)
764 if (parent->child[LEFT] == this)
765 parent->child[LEFT] = child[RIGHT];
766 if (parent->child[RIGHT] == this)
767 parent->child[RIGHT] = child[RIGHT];
769 if (child[RIGHT]->parent == this)
770 child[RIGHT]->parent = parent;
776 startNode = parent;
778 if (parent)
780 if (this == parent->child[LEFT])
782 if (this == parent->child[RIGHT])
785 if (parent)
787 if (parent->child[LEFT] == this)
788 parent->child[LEFT] = NULL;
789 if (parent->child[RIGHT] == this)
790 parent->child[RIGHT] = NULL;
795 parent = child[RIGHT] = child[LEFT] = NULL;
837 parent = insertR;
848 parent = insertL;
862 parent = insertR;
867 parent = insertL;
889 this->parent = insertL;
895 parent = insertL;
918 if (parent)
920 if (parent->child[LEFT] == this)
921 parent->child[LEFT] = to;
922 if (parent->child[RIGHT] == this)
923 parent->child[RIGHT] = to;
927 child[RIGHT]->parent = to;
931 child[LEFT]->parent = to;
933 to->parent = parent;