04-树7 二叉搜索树的操作集 (30分)

来源：互联网发布：淘宝导航尺寸是多少编辑：程序博客网时间：2024/06/05 01:10

本题要求实现给定二叉搜索树的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;}/* 你的代码将被嵌在这里 */BinTree Insert( BinTree BST, ElementType X ){if(BST==NULL){BST=(BinTree)malloc(sizeof(struct TNode));BST->Data=X;BST->Left=BST->Right=NULL;}else if(X>BST->Data){BST->Right=Insert(BST->Right,X);}else if(X<BST->Data){BST->Left=Insert(BST->Left,X);}return BST;}//Position Find( BinTree BST, ElementType X ){if(!BST)return NULL;if(X>BST->Data){return Find(BST->Right,X);}else if(X<BST->Data) {returnFind(BST->Left,X);}else{return BST;}}//Position FindMin( BinTree BST ){if(!BST)return NULL;else if(BST->Left==NULL){return BST;}else{return FindMin(BST->Left);}} //Position FindMax( BinTree BST ){if(!BST)return NULL;else if(BST->Right==NULL){return BST;}else{return FindMax(BST->Right);}} //BinTree Delete( BinTree BST, ElementType X ){Position tmp;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){tmp=FindMin(BST->Right);BST->Data=tmp->Data;BST->Right=Delete(BST->Right,BST->Data);}else{tmp=BST;if(!BST->Left){BST=BST->Right;}else{BST=BST->Left;}free(tmp);}}}return BST; }

0 0