二叉搜索树的插入和删除

typedef int ElementType;
struct TreeNode;
typedef struct TreeNode *Position;
typedef struct TreeNode *SearchTree;
struct TreeNode {
    ElementType element;
    SearchTree Left;
    SearTree Right;
};

Position FindMin(SearchTree T)
{
    if(T == NULL)
        return NULL;
    else if(T->Left == NULL)
        return T;
    else
        return FindMin(T->Left);
}

SearchTree Insert(ElementType X, SearchTree T)
{
    if(T == NULL)
    {
        T = (TreeNode*)malloc(sizeof(struct TreeNode));
        if (T == NULL)
            fataerror("out of space!");
        else
        {
            T->element = X;
            T->Left = T->Right = NULL;
        }
    }
    
    else if(X<T->element)
        T->Left = Insert(X, T->Left);
    else if (X > T->element)
        T->Right = Insert(X, T->Right);
    return T;
}

SearchTree Delete(ElementType X, SearchTree T)
{
    Position TempCell;
    if(T == NULL)
        Error("element not found");
    else if(X < T->Element)
        T->Left = Delete(X, T->Left);
    else if(X>T->element)
        T->right = Delete(X, T->Right);
    else if(T->Left && T-Right)
    {
        TempCell = FindMin(T->right);
        T->element = TempCell->element;
        T->Right = Delete(T->element, T->Right);
    }
    else
    {
        TempCell = T;
        if(T->Left == NULL)
            T = T->Right;
        else if(T->right == NULL)
            T = T->Left;
        free(TempCell);
    }
    return T;
}

参考：《数据结构与算法分析-C语言描述》