void delete_case1(struct rbtree* tree, struct rbtree_node* node)
{
if(node->parent == NULL)
return ;
else
delete_case2(tree,node);
}
/**
* @brief For the condition when n is the only node in the tree.
* @param t is the tree root.
* @param n is the node at which deletion is taking place.
*/
void delete_case1(rbtree t, node n)
{
if (n->parent == NULL)
return;
else
delete_case2(t, n);
}
void delete_case1(struct rbtree* t, struct rbtree_node* n)
{
if (n->parent == NULL)
return;
else
delete_case2(t, n);
}
static inline void
delete_case1(struct RBTREE_TYPENAME* target,
struct RBTREE_NODE* P,
struct RBTREE_NODE* N)
{
if (P != NULL)
delete_case2(target, P, N);
}
static void delete_case1(L_RBTREE *t, node *n) {
if (n->parent == NULL)
return;
else
delete_case2(t, n);
}
void delete_case1(GtkWidget *darea, rbtree t, node n) {
if (n->parent == NULL)
return;
else
delete_case2(darea, t, n);
}
void delete_case1(rb_node* n, rb_tree* tree) {
if (n->parent != NULL)
delete_case2(n, tree);
}
/*deleting the root node - everything is ok*/
void delete_case1(bbst tree, node n) {
if (n->parent == NULL)
return;
else
delete_case2(tree, n);
}
//private function
void Tree::delete_case1()
{
//make sure we have a parent or else we would go into an infinite loop
if(parent)
delete_case2();
}
