二叉树

定义

typedef struct TreeNode *Position;
typedef struct TreeNode *SearchTree;
struct TreeNode
{
    Elementype Element;
    SearchTree Left;
    SearchTree Right;
};

建立一棵空树

SearchTree MakeEmpty(SearchTree T)
{
    if(T != NULL)
    {
        MakeEmpty(T->Left);
        MakeEmpty(T->Right);
        free(T);
    }
    return NULL;
}

二叉查找树

Position Find(Elementype X, SearchTree T)
{
    if(T == NULL)
        return NULL;
    if(X < T->Element)
        return Find(X, T->Left);
    else if(X > T->Element)
        return Find(X, T->Right);
    else
        return T;
}

二叉树查找最小值

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

二叉树查找最大值

Position FindMax(SearchTree T)
{
    if(T != NULL)
        while(T->Right != NULL)
            T = T->Right;
    return T;
}

二叉树插入

SearchTree Insert(Elementype X, SearchTree T)
{
    if(T == NULL)
    {
        T = (struct TreeNode *)malloc(sizeof(struct TreeNode));
        T->Element = X;
        T->Left = T->Right = NULL;
    }
    else if(X > T->Element)
        T->Right = Insert(X, T->Right);
    else if(X < T->Element)
        T->Left = Insert(X, T->Left);
    return T;
}

二叉树删除

情况一：节点是一片树叶：立即删除
情况二：节点有两个儿子：用其右子树中最小的数据替代该节点的数据并递归地删除那个节点。因为右子树中最小的节点不可能有左儿子，所以第二次删除更容易。
情况三：若删除的次数不多，通常使用的策略是懒惰删除：当一个元素要被删除时，它仍留在树中，只是做了个被删除的记号。

SearchTree Delete(Elementype X, SearchTree T)
{
    Position TmpCell;
    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->Left);
    else if(T->Left && T->Right)
    {
        TmpCell = FindMin(T->Right);
        T->Element = TmpCell->Element;
        T->Right = Delete(T->Element, T->Left);
    }
    else
    {
        TmpCell = T;
        if(T->Left == NULL)
            T = T->Right;
        else if(T->Right == NULL)
            T = T->Left;
        free(TmpCell);
    }
    return T;
}