90     QTreeNode *right;       /* right subtree */  member
91     gint8      balance;     /* height (right) - height (left) */
126     node->right = NULL;  in q_tree_node_new()
268             tmp = tmp->right;  in q_tree_node_previous()
293     tmp = node->right;  in q_tree_node_next()
589                 child->right = node;  in q_tree_insert_internal()
602                 node = node->right;  in q_tree_insert_internal()
606                 child->right = node->right;  in q_tree_insert_internal()
608                 node->right = child;  in q_tree_insert_internal()
628         g_assert(!bparent || bparent->left == node || bparent->right == node);  in q_tree_insert_internal()
637                 bparent->right = node;  in q_tree_insert_internal()
762             node = node->right;  in q_tree_remove_internal()
771     g_assert(!parent || parent->left == node || parent->right == node);  in q_tree_remove_internal()
784                 parent->right = node->right;  in q_tree_remove_internal()
788             /* node has a right child */  in q_tree_remove_internal()
793                 tree->root = node->right;  in q_tree_remove_internal()
795                 parent->left = node->right;  in q_tree_remove_internal()
798                 parent->right = node->right;  in q_tree_remove_internal()
806             tmp->right = node->right;  in q_tree_remove_internal()
814                 parent->right = node->left;  in q_tree_remove_internal()
820             QTreeNode *next = node->right;  in q_tree_remove_internal()
838                     nextp->left = next->right;  in q_tree_remove_internal()
845                 next->right = node->right;  in q_tree_remove_internal()
850             /* set the prev to point to the right place */  in q_tree_remove_internal()
852                 prev = prev->right;  in q_tree_remove_internal()
854             prev->right = next;  in q_tree_remove_internal()
866                 parent->right = next;  in q_tree_remove_internal()
877                      bparent->right == balance);  in q_tree_remove_internal()
887                     bparent->right = balance;  in q_tree_remove_internal()
1176         if (node->right->balance < 0) {  in q_tree_node_balance()
1177             node->right = q_tree_node_rotate_right(node->right);  in q_tree_node_balance()
1212             node = node->right;  in q_tree_find_node()
1243             node = node->right;  in q_tree_node_search()
1251     QTreeNode *right;  in q_tree_node_rotate_left()  local
1255     right = node->right;  in q_tree_node_rotate_left()
1257     if (right->left_child) {  in q_tree_node_rotate_left()
1258         node->right = right->left;  in q_tree_node_rotate_left()
1261         right->left_child = TRUE;  in q_tree_node_rotate_left()
1263     right->left = node;  in q_tree_node_rotate_left()
1266     b_bal = right->balance;  in q_tree_node_rotate_left()
1270             right->balance = b_bal - 1;  in q_tree_node_rotate_left()
1272             right->balance = a_bal + b_bal - 2;  in q_tree_node_rotate_left()
1277             right->balance = a_bal - 2;  in q_tree_node_rotate_left()
1279             right->balance = b_bal - 1;  in q_tree_node_rotate_left()
1284     return right;  in q_tree_node_rotate_left()
1297         node->left = left->right;  in q_tree_node_rotate_right()
1302     left->right = node;  in q_tree_node_rotate_right()
1342             right_height = q_tree_node_height(node->right);  in q_tree_node_height()
1361             g_assert(tmp->right == node);  in q_tree_node_check()
1376             right_height = q_tree_node_height(node->right);  in q_tree_node_check()
1386             q_tree_node_check(node->right);  in q_tree_node_check()