本题要求实现给定二叉搜索树的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
并返回结果树的根结点指针; - 函数
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 InorderTraversal( BinTree BT ){
if(BT){
InorderTraversal(BT->Left);
printf("%d ",BT->Data);
InorderTraversal(BT->Right);
}
}
void PreorderTraversal( BinTree BT ){
if(BT){
printf("%d ",BT->Data);
InorderTraversal(BT->Left);
InorderTraversal(BT->Right);
}
}
示例代码:
/* 你的代码将被嵌在这里 */
BinTree Insert( BinTree BST, ElementType X )
{
if(BST){
if(X > BST->Data){//X比根大,插入到右边
BST->Right = Insert(BST->Right,X);//这里不能直接return,递归赋值最终返回得到的是更新过的树,另外递归要考虑返回的类型的
}else if(X < BST->Data ){//插入到左边,不考虑等于
BST->Left = Insert(BST->Left,X);
}
}else{
BinTree T = (BinTree)malloc(sizeof(struct TNode));
T->Data = X;
T->Left = T->Right = NULL;//这里不能省略,搞得我一直不能调试就这里出问题,气死了
BST = T;
}
return BST;
}
BinTree Delete( BinTree BST, ElementType X )
{
Position temp;
if(BST == NULL){
printf("Not Found\n");
return BST;
}else if(X == BST->Data){//删除考虑三种情况,两个子树都存在从右子树找最小的接上
if(BST->Left && BST->Right){//左右都存在
temp = FindMin(BST->Right);
BST->Data = temp->Data;//此时BST已经换好值了,要删除temp
BST->Right = Delete(BST->Right,temp->Data);
}else{
temp = BST;
if(!BST->Left){
BST = BST->Right;
}
else if(!BST->Right){
BST = BST->Left;
}
free(temp);//这里的free不要乱来,不然会错,还是go语言好用,C释放指针真的头大
}
}
else if(X > BST->Data){//X比根大,插入到右边
BST->Right = Delete(BST->Right,X);
}else{//插入到左边,不考虑等于
BST->Left = Delete(BST->Left,X);
}
return BST;
}
Position Find( BinTree BST, ElementType X )
{
if(BST == NULL){//没找到或者空树
return BST;
}
if(BST->Data == X){
return BST;
}else if(BST->Data > X){//根比X大往左走
BST = Find(BST->Left,X);
}else{//根比X小往右走
BST = Find(BST->Right,X);
}
}
Position FindMin( BinTree BST )//两个函数的思路都是一直往左/右递归,到左/右子树空说明最小/大
{
if(BST == NULL) return BST;
if(BST->Left == NULL){
return BST;
}
BST = FindMin(BST->Left);
}
Position FindMax( BinTree BST )
{
if(BST == NULL) return BST;
if(BST->Right == NULL){
return BST;
}
BST = FindMax(BST->Right);
}