本题要求实现给定二叉搜索树的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 #include
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; iData); 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题目很简单,其中的三个函数mooc课上都有
BinTree Insert(BinTree BST, ElementType X) {
if(!BST) {
BST = (BinTree)malloc(sizeof(struct TNode));
BST->Left = NULL;
BST->Right = NULL;
BST->Data = X;
}
else if (X < BST->Data) {
BST->Left = Insert(BST->Left, X);
}
else if(X > BST->Data){
BST->Right = Insert(BST->Right, X);
}
return BST;
}
Position FindMin(BinTree BST) {
if (BST) {
while (BST->Left != NULL) {
BST = BST->Left;
}
}
return BST;
}
Position FindMax(BinTree BST) {
if (BST) {
while (BST->Right != NULL) {
BST = BST->Right;
}
}
return BST;
}
Position Find(BinTree BST, ElementType X) {
if (!BST)
return NULL;
if (X < BST->Data) {
return Find(BST->Left, X);
}
else if (X > BST->Data) {
return Find(BST->Right, X);
}
else
return BST;
}
BinTree Delete(BinTree BST, ElementType X) {
BinTree p;
if (!BST) {
printf("Not Found\n");
return BST;
}
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) {
p = FindMax(BST->Left);
BST->Data = p->Data;
BST->Left = Delete(BST->Left, BST->Data);
}
else {
p = BST;
if (!BST->Left) {
BST = BST->Right;
}
else if (!BST->Right) {
BST = BST->Left;
}
free(p);
}
}
return BST;
}
废江博客 , 版权所有丨如未注明 , 均为原创丨本网站采用BY-NC-SA协议进行授权 转载请注明原文链接:04-树7 二叉搜索树的操作集