本题要求实现给定二叉搜索树的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
程序代码:
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 BT=BST;
BinTree T=(struct TNode*)malloc(sizeof(struct TNode));
T->Data=X;
T->Left=NULL;
T->Right=NULL;
while(BST)
{
if(X>=BST->Data)
{
if(BST->Right)
BST=BST->Right;
else
{
BST->Right=T;
return BT;
}
}
else
{
if(BST->Left)
BST=BST->Left;
else
{
BST->Left=T;
return BT;
}
}
}
return T;//空树
}
Position FindMax( BinTree BST )
{
if(!BST)//不加有错 因为T->Right
return NULL;
BinTree T=BST;
while(T->Right)
T=T->Right;
return T;
}
Position FindMin( BinTree BST )
{
if(!BST)//不加有错 因为T->Left
return NULL;
BinTree T=BST;
while(T->Left)
T=T->Left;
return T;
}
Position Find( BinTree BST, ElementType X )
{
BinTree T=BST;
while(T)
{
if(T->Data==X)
return T;
else if(T->Data<X)
T=T->Right;
else
T=T->Left;
}
return NULL;
}
BinTree Delete( BinTree BST, ElementType X )
{
BinTree head=BST;
BinTree T=Find(BST,X);
if(!T)
{
printf("Not Found\n");
return head;
}
BinTree Tlm=FindMax(T->Left);//找删除点左子树最大的
if(Tlm)
{
T->Data=Tlm->Data;
if(T->Left==Tlm)//如果有 那么Tlm一定没有右支 因为是 找左边的最大值 如果有右支就不会执行这句话
T->Left=Tlm->Left;
else
{
T=T->Left;
while(T->Right!=Tlm)
T=T->Right;
T->Right=Tlm->Left;//找到右支上的删除点 删除点的左子树右子树一定比T大 故Tlm->Left接在T->Right
}
}
else
{
BinTree Trm=FindMin(T->Right);//找删除点右子树最小的
if(Trm)
{
T->Data=Trm->Data;
if(T->Right==Trm)
T->Right=Trm->Right;
else
{
T=T->Right;
while(T->Left!=Trm)
T=T->Left;
T->Left=Trm->Right;//找到左支上的删除点 删除点的左子树右子树一定比T小 故Trm->Right接在T->Left
}
}
else
{
if(BST==T)
{
return NULL;
}
else
{
while(BST)
{
if(BST->Data>=T->Data)
{
if(BST->Left==T)
BST->Left=NULL;
BST=BST->Left;
}
else
{
if(BST->Right==T)
BST->Right=NULL;
BST=BST->Right;
}
}
}
}
}
return head;
}