6-12 二叉搜索树的操作集 (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 );
#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)
{
BinTree p=(BinTree)malloc(sizeof(struct TNode));
p->Data=X;
p->Left=p->Right=NULL;
BST=p;
}
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 )
{
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(X==BST->Data)
{
if(BST->Left&&BST->Right)
{
BinTree t=FindMin(BST->Right);
BST->Data=t->Data;
BST->Right=Delete(BST->Right,BST->Data);
}
else
{
if(!BST->Left) BST=BST->Right;
else if(!BST->Right) BST=BST->Left;
}
}
}
return BST;
}
Position Find( BinTree BST, ElementType X )
{
while(BST)
{
if(BST->Data==X) return BST;
else if(X>BST->Data) BST=BST->Right;
else BST=BST->Left;
}
return NULL;
}
Position FindMin( BinTree BST )
{
while(BST)
{
if(BST->Left)
BST=BST->Left;
else return BST;
}
return BST;
}
Position FindMax( BinTree BST )
{
while(BST)
{
if(BST->Right)
BST=BST->Right;
else return BST;
}
return BST;
}