二叉搜索树的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;
}
/* 你的代码将被嵌在这里 */
code
Insert
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(BST->Data>X)
BST->Left=Insert(BST->Left,X);
else
BST->Right=Insert(BST->Right,X);
}
return BST;
}
Find
Position Find( BinTree BST, ElementType X )
{
while(BST!=NULL)//利用循环
{
if(X<BST->Data)//左子树
{
BST=BST->Left;
}
else
{
if(X>BST->Data)//右子树
BST=BST->Right;
else
break;//找到
}
}
return BST;
}
FindMin
Position FindMin( BinTree BST )
{
if(BST)
while(BST->Left)
BST=BST->Left;
return BST;
}
FindMax
Position FindMax( BinTree BST )
{
if(BST)
while(BST->Right)
BST=BST->Right;
return BST;
}
Delete 递归形式
BinTree Delete( BinTree BST, ElementType X )
{
Position tag;
if(BST==NULL)
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!=NULL && BST->Right!=NULL)
{
tag=FindMin(BST->Right);
BST->Data=tag->Data;
BST->Right=Delete(BST->Right,BST->Data);
}
else
{
tag=BST;
if(BST->Left==NULL)
BST=BST->Right;
else
if(BST->Right==NULL)
BST=BST->Left;
free(tag);
}
return BST;
}
Delete 非递归
bool Delete(tree* &p)
{
tree* q,*s;
if(!p->rchild)//右子树为空
{
q=p;
p=p->lchild;
free(q);
}
else
{
if(!p->lchild)
{
q=p;
p=p->rchild;
free(q);
}
else
{
q=p;
s=p->lchild;
while(s->rchild)
{q=s;s=s->rchild;}
p->data=s->data;
if(q!=p)
q->rchild=s->lchild;
else
q->lchild=s->lchild;
free(s);
}
}
return true;
}