4-2-二叉搜索树 二叉搜索树的操作集 (30 分)

本题要求实现给定二叉搜索树的5种常用操作。

函数接口定义：

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

其中BinTree结构定义如下：

typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right; };

函数Insert将X插入二叉搜索树BST并返回结果树的根结点指针；
函数Delete将X从二叉搜索树BST中删除，并返回结果树的根结点指针；如果X不在树中，则打印一行Not Found并返回原树的根结点指针；
函数Find在二叉搜索树BST中找到X，返回该结点的指针；如果找不到则返回空指针；
函数FindMin返回二叉搜索树BST中最小元结点的指针；
函数FindMax返回二叉搜索树BST中最大元结点的指针。

裁判测试程序样例：

#include <stdio.h>
#include <stdlib.h>

typedef int ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

void PreorderTraversal( BinTree BT ); /* 先序遍历，由裁判实现，细节不表 */
void InorderTraversal( BinTree BT );  /* 中序遍历，由裁判实现，细节不表 */

BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for ( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
    printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp==MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp==MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for( i=0; i<N; i++ ) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
    printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}

/* 你的代码将被嵌在这里 */
输入样例：

10
5 8 6 2 4 1 0 10 9 7
5
6 3 10 0 5
5
5 7 0 10 3

输出样例：

Preorder: 5 2 1 0 4 8 6 7 10 9
6 is found
3 is not found
10 is found
10 is the largest key
0 is found
0 is the smallest key
5 is found
Not Found
Inorder: 1 2 4 6 8 9

#include <stdio.h>
#include <stdlib.h>
typedef int ElementType;
typedef struct TNode* Position;
typedef Position BinTree;
struct TNode {
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

void PreorderTraversal(BinTree BT) /* 先序遍历，由裁判实现，细节不表 */
{
   if (BT) {
        printf(" %d", BT->Data);
        PreorderTraversal(BT->Left);
        PreorderTraversal(BT->Right);
    }
}
void InorderTraversal(BinTree BT)  /* 中序遍历，由裁判实现，细节不表 */
{ 
    if (BT) {
        InorderTraversal(BT->Left);
        printf(" %d", BT->Data);
        InorderTraversal(BT->Right);
    }
}

BinTree Insert(BinTree BST, ElementType X);
BinTree Delete(BinTree BST, ElementType X);
Position Find(BinTree BST, ElementType X);
Position FindMin(BinTree BST);
Position FindMax(BinTree BST);

int main()
{
    BinTree BST, MinP, MaxP, Tmp;
    ElementType X;
    int N, i;

    BST = NULL;
    scanf("%d", &N);
    for (i = 0; i < N; i++) {
        scanf("%d", &X);
        BST = Insert(BST, X);
    }
    printf("Preorder:"); PreorderTraversal(BST); printf("\n");
    MinP = FindMin(BST);
    MaxP = FindMax(BST);
    scanf("%d", &N);
    for (i = 0; i < N; i++) {
        scanf("%d", &X);
        Tmp = Find(BST, X);
        if (Tmp == NULL) printf("%d is not found\n", X);
        else {
            printf("%d is found\n", Tmp->Data);
            if (Tmp == MinP) printf("%d is the smallest key\n", Tmp->Data);
            if (Tmp == MaxP) printf("%d is the largest key\n", Tmp->Data);
        }
    }
    scanf("%d", &N);
    for (i = 0; i < N; i++) {
        scanf("%d", &X);
        BST = Delete(BST, X);
    }
    printf("Inorder:"); InorderTraversal(BST); printf("\n");

    return 0;
}

BinTree Insert(BinTree BST, ElementType X) {//递归不递归都有
    //非递归
    //BinTree T = BST;
    //if (BST == NULL) {
    //    BinTree New = (BinTree)malloc(sizeof(struct TNode));
    //    New->Left = New->Right = NULL;
    //    New->Data = X;
    //    T = New;
    //}
    //else {
    //    while (BST) {
    //        if (X < BST->Data) {
    //            if (BST->Left) BST = BST->Left;
    //            else {
    //                BinTree New = (BinTree)malloc(sizeof(struct TNode));
    //                New->Left = New->Right = NULL;
    //                New->Data = X;
    //                BST->Left = New;
    //                break;
    //            }
    //        }
    //        else if (X > BST->Data)
    //        {
    //            if (BST->Right) BST = BST->Right;//当BST->Left或者BST->Right为NULL，就可以跳出准备接新的子树了  
    //            else {
    //                BinTree New = (BinTree)malloc(sizeof(struct TNode));
    //                New->Left = New->Right = NULL;
    //                New->Data = X;
    //                BST->Right = New;
    //                break;
    //            }
    //        }
    //        else return T;//当该数据已经有了便什么都不做
    //    }
    //}
    //return T;
    //递归写法
    if (!BST) {
        BST = (BinTree)malloc(sizeof(struct TNode));
        BST->Data = X;
        BST->Left = BST->Right = NULL;
    }
    else
    {
        if (X < BST->Data) BST->Left = Insert(BST->Left, X);//!!!!!
        else if (X > BST->Data) BST->Right = Insert(BST->Right, X);
        //X=BST->Data不作处理
    }
    return BST;
}
BinTree Delete(BinTree BST, ElementType X) {//暂时只会递归写法
    if (!BST) printf("Not Found\n");
    else if (X < BST->Data) BST->Left = Delete(BST->Left, X);//!!!!!
    else if (X > BST->Data) BST->Right = Delete(BST->Right, X);
    else {
        if (BST->Left && BST->Right)//左子树，右子树都有
        {
            Position temp = FindMin(BST->Right);//找右子树的最小值就是，右边的最小值在右子树的最左边，没有叶节点，
            //删除方便，且用此数代替原来被删的X，X的左子树的值都比这个数小，右边的都比这个大，二叉树总体没变
            //（废话）是FindMin(BST->Right)不是FindMin(BST);
            BST->Data = temp->Data;
            Delete(BST->Right, temp->Data);
        }
        else if (!BST->Left && !BST->Right)//左右子树都没有，可以直接删
        {
            //Position temp = BST;
            //BST = BST->Right;
            //free(temp);
            BST = NULL;
            //这两种写法好像都可以，就是下面这种写法BST的Left，Right还是有的，都为NULL
        }
        else {//有左子树或者右子树
            Position temp = BST;
            if (BST->Left) BST = BST->Left;
            else if (BST->Right) BST = BST->Right;
            free(temp);
        }
    }
    return BST;
}
Position Find(BinTree BST, ElementType X)
{
    while (BST)
    {
        if (X < BST->Data)
        {
            if (BST->Left) BST = BST->Left;
            else break;
        }
        else if (X > BST->Data)
        {
            if (BST->Right) BST = BST->Right;
            else break;
        }
        else return BST;//X==BST->Data;
    }
    return NULL;
}
Position FindMin(BinTree BST)//最小的数在最左边
{
    while (BST&&BST->Left)
    {
        BST = BST->Left;
    }
    return BST;
}
Position FindMax(BinTree BST)//最大的数在最右边
{
    while (BST&&BST->Right)//这样如果是空表之间返回NULL
    {
        BST = BST->Right;
    }
    return BST;
}