729     QTreeNode *node, *parent, *balance;  in q_tree_remove_internal()  local
770     balance = parent = path[--idx];  in q_tree_remove_internal()
771     g_assert(!parent || parent->left == node || parent->right == node);  in q_tree_remove_internal()
772     left_node = (parent && node == parent->left);  in q_tree_remove_internal()
776             if (!parent) {  in q_tree_remove_internal()
779                 parent->left_child = FALSE;  in q_tree_remove_internal()
780                 parent->left = node->left;  in q_tree_remove_internal()
781                 parent->balance += 1;  in q_tree_remove_internal()
783                 parent->right_child = FALSE;  in q_tree_remove_internal()
784                 parent->right = node->right;  in q_tree_remove_internal()
785                 parent->balance -= 1;  in q_tree_remove_internal()
792             if (!parent) {  in q_tree_remove_internal()
795                 parent->left = node->right;  in q_tree_remove_internal()
796                 parent->balance += 1;  in q_tree_remove_internal()
798                 parent->right = node->right;  in q_tree_remove_internal()
799                 parent->balance -= 1;  in q_tree_remove_internal()
808             if (parent == NULL) {  in q_tree_remove_internal()
811                 parent->left = node->left;  in q_tree_remove_internal()
812                 parent->balance += 1;  in q_tree_remove_internal()
814                 parent->right = node->left;  in q_tree_remove_internal()
815                 parent->balance -= 1;  in q_tree_remove_internal()
825             /* path[idx] == parent */  in q_tree_remove_internal()
826             /* find the immediately next node (and its parent) */  in q_tree_remove_internal()
861             if (!parent) {  in q_tree_remove_internal()
864                 parent->left = next;  in q_tree_remove_internal()
866                 parent->right = next;  in q_tree_remove_internal()