题目:二叉搜索树的操作集
二叉搜索树的各种操作!
代码:
#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;
}
void PreorderTraversal( BinTree BT ){ /* 先序遍历,由裁判实现,细节不表 */
printf(" %d",BT->Data);
if(BT->Left) PreorderTraversal(BT->Left);
if(BT->Right) PreorderTraversal(BT->Right);
}
void InorderTraversal( BinTree BT ){ /* 中序遍历,由裁判实现,细节不表 */
if(BT->Left) PreorderTraversal(BT->Left);
printf(" %d",BT->Data);
if(BT->Right) PreorderTraversal(BT->Right);
}
BinTree Insert( BinTree BST, ElementType X ){//插入
if(!BST){//到达插入点,即叶子节点的左或右
BST = (BinTree)malloc(sizeof(struct TNode));
BST->Data = X;
BST->Left = NULL;
BST->Right = NULL;
}
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 ){
BinTree Tmp;
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(BST->Left && BST->Right){//左右子树都有结点
Tmp = FindMin(BST->Right);//在右子树上找最小结点
BST->Data = Tmp->Data;//将最小结点赋值到删除元素位置上
BST->Right = Delete(BST->Right,BST->Data);//将刚刚找到的最小结点删除
}
else{
Tmp = BST;
if(!BST->Left)//当没有左子树时将右树链到删除位置上
BST = BST->Right;
else if(!BST->Right)//当没有右子树时将左树链到删除位置上
BST = BST->Left;
free(Tmp);//释放删除结点空间
}
return BST;//返回结点
}
Position Find( BinTree BST, ElementType X ){
if(!BST) return NULL;
if(BST->Data == X) return BST;
if(X < BST->Data) return Find(BST->Left,X);
else return Find(BST->Right,X);
}
Position FindMin( BinTree BST ){
if(!BST) return NULL;//空树
if(!BST->Left) return BST;//找到最左边值并返回
return FindMin(BST->Left); //继续向左寻找
}
Position FindMax( BinTree BST ){
/*if(!BST) return NULL;//空树
if(!BST->Right) return BST;//找到
return FindMax(BST->Right); */
if(BST)
while(BST->Right) BST = BST->Right;
return BST;
}