二叉搜索树的操作集(30 分)
发布时间:2020-12-14 03:22:39 所属栏目:大数据 来源:网络整理
导读:6-12?二叉搜索树的操作集(30?分) 本题要求实现给定二叉搜索树的5种常用操作。 函数接口定义: BinTree Insert( BinTree BST,ElementType X );BinTree Delete( BinTree BST,ElementType X );Position Find( BinTree BST,ElementType X );Position FindMin(
6-12?二叉搜索树的操作集(30?分)本题要求实现给定二叉搜索树的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 ); 其中 typedef struct TNode *Position; typedef Position BinTree; struct TNode{ ElementType Data; BinTree Left; BinTree Right; };
裁判测试程序样例:#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 ); 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 foundn",X); else { printf("%d is foundn",Tmp->Data); if (Tmp==MinP) printf("%d is the smallest keyn",Tmp->Data); if (Tmp==MaxP) printf("%d is the largest keyn",Tmp->Data); } } 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 #include <iostream> #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 ); Position FindMin( BinTree BST ); Position FindMax( BinTree BST ); int main() { BinTree BST,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 foundn",X); else { printf("%d is foundn",Tmp->Data); if (Tmp==MinP) printf("%d is the smallest keyn",Tmp->Data); if (Tmp==MaxP) printf("%d is the largest keyn",Tmp->Data); } } scanf("%d",&X); BST = Delete(BST,X); } printf("Inorder:"); InorderTraversal(BST); printf("n"); return 0; } /* 你的代码将被嵌在这里 */ void PreorderTraversal( BinTree BT ) { if(BT==NULL) return; else{ printf(" %c",BT->Data); PreorderTraversal(BT->Left); PreorderTraversal(BT->Right); } } void InorderTraversal( BinTree BT ) { if(BT==NULL) return; else{ InorderTraversal(BT->Left); printf(" %c",BT->Data); InorderTraversal(BT->Right); } } BinTree Insert( BinTree BST,ElementType X ) { if(!BST)//如果BST为空的话,返回只有一个节点的树 { BST=(BinTree)malloc(sizeof(struct TNode)); BST->Data=X; BST->Left=NULL; BST->Right=NULL; } else//如果BST不是为空的话 {//开始寻找要插入的位置 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 Foundn"); 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;/*有左孩子,一定要加else,不然BST可能是NULL,会段错误*/ free(Tmp); /*如无左右孩子直接删除*/ } } } return BST; } Position Find( BinTree BST,ElementType X ) { if(!BST) return NULL; if(BST->Data==X) return BST; else if(X<BST->Data) { return Find(BST->Left,X); } else if(X>BST->Data) { return Find(BST->Right,X); } return BST; } Position FindMin( BinTree BST ) { if(BST!=NULL) { while(BST->Left) BST=BST->Left; } return BST; } Position FindMax( BinTree BST ) { if(BST!=NULL) { while(BST->Right) BST=BST->Right; } return BST; } (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |