DELETE

node_id* delete_id(node_id* tree, int id)
{
    if (tree == NULL)
    {
        return tree;
    }
    if (id < tree->id)
        //delete node from left subtree
        tree->left = delete_id(tree->left, id);
    else if (id > tree->id)
        //delete node from right subtree
        tree->right = delete_id(tree->right, id);

    else
    {

        if (tree->left == NULL)
        {
            node_id* temp = tree->right;
            free(tree);
            return temp;
        }
        else if (tree->right == NULL)
        {
            node_id* temp = tree->left;
            free(tree);
            return temp;
        }

        node_id* temp = min_value_node_id(tree->right);

        tree->id = temp->id;
        strcpy(tree->name, temp->name);
        tree->right = delete_id(tree->right, temp->id);
    }
    return tree;
}


node_id* delete_name(node_id* tree, char* name)
{
    if (tree == NULL)
    {
        return tree;
    }
    if (strcmp(name, tree->name) > 0)
        tree->left = delete_name(tree->left, name);
    else if (strcmp(name, tree->name) < 0)
    {
        tree->right = delete_name(tree->right, name);
    }
    else
    {
        if (tree->left == NULL)
        {
            node_id* temp = tree->right;
            free(tree);
            return temp;
        }
        else if (tree->right == NULL)
        {
            node_id* temp = tree->left;
            free(tree);
            return temp;
        }
        node_id* temp = min_value_node_id(tree->right);
        strcpy(tree->name, temp->name);
        tree->id = temp->id;

        tree->right = delete_name(tree->right, temp->name);
    }
    return tree;
}