6-12 二叉搜索树的操作集 (30 分)

裁判测试程序样例：

#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;
}
/* 你的代码将被嵌在这里 */

 

 代码代码：

BinTree Insert( BinTree BST, ElementType X )
{//只能插到叶子结点
    if(BST==NULL){//新建结点，左右置空
        BST=(BinTree)malloc(sizeof(struct TNode));
        BST->Data=X;
        BST->Left=NULL;
        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);
       }

    return BST;
}
BinTree Delete( BinTree BST, ElementType X )
{
    BinTree tmp;
    if(BST==NULL) 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){
                tmp=FindMin(BST->Right);//找到右子树最小的（比左子树都大但比右子树都小）作为结点
                BST->Data=tmp->Data;//仅需要赋值数据
                BST->Right=Delete(BST->Right,tmp->Data);//将tmp结点删除（必没有左右子树），返回根节点即原节点的右子树结点
            }
            else{//左子树或者右子树为空
                tmp=BST;
                if(BST->Left==NULL){BST=BST->Right;}
                    
                else if(BST->Right==NULL){BST=BST->Left;}
                    
            free(tmp);
            }
    }
    }

    return BST;
}
Position Find( BinTree BST, ElementType X )
{
    if(!BST)
        return NULL;
    if(BST->Data==X)
        return BST;
    else if(X<BST->Data)
       {
           return Find(BST->Left,X);
       }
    else if(X>BST->Data)
        {
            return Find(BST->Right,X);
        }

}
Position FindMin( BinTree BST )
{
    if(BST){
        while(BST->Left)
           {
              BST=BST->Left;
           }
    }
    return BST;
}
Position FindMax( BinTree BST )
{
    if(BST){
        while(BST->Right)
          {
             BST=BST->Right;
          }
    }
    return BST;
}