本题要求实现链式表的操作集。
函数接口定义:
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
实现代码:
BinTree Insert(BinTree BST, ElementType X){
if(BST == NULL){ //若为空树,则直接创建节点
BinTree cur = (BinTree)malloc(sizeof(struct TNode));
cur->Left = NULL;
cur->Right = NULL;
cur->Data = X;
return cur;
}
else if(X > BST->Data){ //若大于根节点,则递归插入右子树
BST->Right = Insert(BST->Right,X);
}
else if(X < BST->Data){ //若小于根节点,则递归插入左子树
BST->Left = Insert(BST->Left,X);
}
return BST;
}
BinTree Delete(BinTree BST,ElementType X){
if(BST == NULL){ //若为空树,则直接返回
printf("Not Found\n");
return NULL;
}
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 == NULL && BST->Right == NULL){
return NULL; //若左右孩子均为空,则直接返回NULL
}
else if(BST->Left == NULL && BST->Right !=NULL){
BST = BST->Right; //若仅左孩子为空,则用右孩子替换
}
else if(BST->Left != NULL && BST->Right == NULL){
BST = BST->Left; //若仅右孩子为空,则用左孩子替换
}
else if(BST->Left != NULL && BST->Right !=NULL){ //若左右孩子均不空
BST->Data = FindMin(BST->Right)->Data; //找到右子树上的最小值替换
BST->Right = Delete(BST->Right,BST->Data); //递归删除右子树
}
}
return BST;
}
Position Find(BinTree BST, ElementType X){
if(BST == NULL){ //若为空树,则直接返回
return NULL;
}
if(X < BST->Data){ //若小于根节点,则递归遍历左子树
return Find(BST->Left,X);
}
else if(X > BST->Data){ //若大于根节点,则递归遍历右子树
return Find(BST->Right,X);
}
else if(X == BST->Data){ //若等于根节点,则返回该结点
return BST;
}
return BST;
}
Position FindMin(BinTree BST){
if(BST == NULL){
return BST; //若为空树,则直接返回
}
else{
while(BST->Left){
BST = BST->Left; //不断遍历左子树以找到最小值
}
return BST;
}
}
Position FindMax(BinTree BST){
if(BST == NULL){
return BST; //若为空树,则直接返回
}
else{
while(BST->Right){
BST = BST->Right; //不断遍历右子树以找到最大值
}
return BST;
}
}