grandchild->parent = NULL;
root = grandchild;
- } else if (c > 0 && (grandchild = child->right)) {
+ } else if(c > 0 && (grandchild = child->right)) {
leftbottom->right = child;
child->parent = leftbottom;
leftbottom = child;
grandchild->parent = NULL;
root = grandchild;
- } else if (c < 0 && (grandchild = child->left)) {
+ } else if(c < 0 && (grandchild = child->left)) {
rightbottom->left = child;
child->parent = rightbottom;
rightbottom = child;
root = child;
break;
}
- } else {
+ } else
break;
- }
}
/* Merge trees */
node = node->right;
else
break;
- } else {
+ } else
break;
- }
}
if(result)
} else if(node->next) {
tree->root = node->right;
node->right->parent = NULL;
- } else {
+ } else
tree->root = NULL;
- }
tree->count--;
}