Lines Matching refs:root
121 AvlNode* root; // root node
204 static void avl_swl ( AvlNode** root )
206 AvlNode* a = *root;
208 *root = b;
214 static void avl_swr ( AvlNode** root )
216 AvlNode* a = *root;
218 *root = b;
224 static void avl_nasty ( AvlNode* root )
226 switch (root->balance) {
228 root->left->balance = 0;
229 root->right->balance = 1;
232 root->left->balance =-1;
233 root->right->balance = 0;
236 root->left->balance = 0;
237 root->right->balance = 0;
239 root->balance = 0;
311 t->root = NULL;
358 t->root = NULL;
389 if (t->root)
390 stackPush(t, t->root, 1);
457 ? slow_cmp(t, slow_key_of_node(t, n), t->root)
458 : fast_cmp( fast_key_of_node( n), t->root);
469 if (t->root->left) {
472 left_subtree.root = t->root->left;
476 switch (t->root->balance--) {
480 if (t->root->left->balance < 0) {
481 avl_swr(&(t->root));
482 t->root->balance = 0;
483 t->root->right->balance = 0;
485 avl_swl(&(t->root->left));
486 avl_swr(&(t->root));
487 avl_nasty(t->root);
490 t->root->left=left_subtree.root;
494 t->root->left = n;
495 if (t->root->balance--) return False;
501 if (t->root->right) {
504 right_subtree.root = t->root->right;
508 switch (t->root->balance++) {
512 if (t->root->right->balance > 0) {
513 avl_swl(&(t->root));
514 t->root->balance = 0;
515 t->root->left->balance = 0;
517 avl_swr(&(t->root
518 avl_swl(&(t->root));
519 avl_nasty(t->root);
522 t->root->right=right_subtree.root;
526 t->root->right = n;
527 if (t->root->balance++) return False;
553 if (!t->root) {
554 t->root = n;
578 AvlNode* curr = t->root;
657 vg_assert(t->root->left);
659 left_subtree.root = t->root->left;
663 t->root->left = left_subtree.root;
665 switch (t->root->balance++) {
669 switch (t->root->right->balance) {
671 avl_swl(&(t->root));
672 t->root->balance = -1;
673 t->root->left->balance = 1;
676 avl_swl(&(t->root));
677 t->root->balance = 0;
678 t->root->left->balance = 0;
681 avl_swr(&(t->root->right));
682 avl_swl(&(t->root));
683 avl_nasty(t->root);
692 vg_assert(t->root->right);
694 right_subtree.root = t->root->right;
698 t->root->right = right_subtree.root;
700 switch (t->root->balance--) {
704 switch (t->root->left->balance) {
706 avl_swr(&(t->root));
707 t->root->balance = 1;
708 t->root->right->balance = -1;
711 avl_swr(&(t->root));
712 t->root->balance = 0;
713 t->root->right->balance = 0;
716 avl_swl(&(t->root->left));
717 avl_swr(&(t->root));
718 avl_nasty(t->root);
726 vg_assert(t->root == n);
731 // Remove the root of the AVL tree t.
738 if (!t->root->left) {
739 if (!t->root->right) {
740 t->root = NULL;
743 t->root = t->root->right;
746 if (!t->root->right) {
747 t->root = t->root->left;
750 if (t->root->balance < 0) {
752 n = t->root->left;
756 n = t->root->right;
760 n->left = t->root->left;
761 n->right = t->root->right;
762 n->balance = t->root->balance;
763 t->root = n;
807 if (t->root)
808 stackPush(t, t->root, 1);
872 if (!oset->root)
876 t = oset->root;
943 OSet_Print2(t, t->root, strElem, 0);
