编写程序,从键盘输入10个整数,逐个插入到二叉排序树中。根据你输入的整数序列,在草稿纸上画出该树。
(1)分别用先序、中序、后序遍历该树并输出结果,检查结果是否正确。
(2)输出该树的高度,检查结果是否正确。
(3)输出结点总数,检查结果是否正确。
(4)从树中删除一个整数,遍历该树并输出,检查结果是否正确。
#include<stdio.h>
#include<stdlib.h>
struct TreeNode{
int Data;
struct TreeNode *Left;
struct TreeNode *Right;
};
struct TreeNode *createNode(int num){
struct TreeNode *Node;
Node=(struct TreeNode *)malloc(sizeof(struct TreeNode));
Node->Data=num;
Node->Left=NULL;
Node->Right=NULL;
return Node;
}
struct TreeNode *insertTree(struct TreeNode *T,int num){
if(T==NULL){
return createNode(num);
}
if(num<T->Data){
T->Left=insertTree(T->Left,num);
}else if(T->Data<num){
T->Right=insertTree(T->Right,num);
}
return T;
}
void preOrder(struct TreeNode *T){
if(T!=NULL){
printf("%4d",T->Data);
preOrder(T->Left);
preOrder(T->Right);
}
}
void inOrder(struct TreeNode *T){
if(T!=NULL){
inOrder(T->Left);
printf("%4d",T->Data);
inOrder(T->Right);
}
}
void postOrder(struct TreeNode *T){
if(T!=NULL){
postOrder(T->Left);
postOrder(T->Right);
printf("%4d",T->Data);
}
}
int Max(int n1,int n2){
if(n1>n2){
return n1;
}
return n2;
}
int Height(struct TreeNode *T){
if(T==NULL){
return 0;
}
return 1+Max(Height(T->Left),Height(T->Right));
}
int Count(struct TreeNode *T){
if(T==NULL){
return 0;
}
return 1+Count(T->Left)+Count(T->Right);
}
struct TreeNode *findMin(struct TreeNode *T){
if(T==NULL){
return NULL;
}
if(T->Left==NULL){
return T;
}
return findMin(T->Left);
}
struct TreeNode *deleteNode(struct TreeNode *T,int num){
if(T==NULL){
return NULL;
}
if(T->Data>num){
T->Left=deleteNode(T->Left,num);
}else if(T->Data<num){
T->Right=deleteNode(T->Right,num);
}else if(T->Left!=NULL&&T->Right!=NULL){
struct TreeNode *min=findMin(T->Right);
T->Data=min->Data;
T->Right=deleteNode(T->Right,min->Data);
}else{
if(T->Left==NULL){
T=T->Right;
}else if(T->Right==NULL){
T=T->Left;
}
}
return T;
}
int main(){
struct TreeNode *T;
T=NULL;
int num;
for(int i=0;i<10;i++){
printf("请输入要插入的第%d个数:",i+1);
scanf("%d",&num);
T=insertTree(T,num);
}
printf("先序遍历:");
preOrder(T);
printf("\n中序遍历:");
inOrder(T);
printf("\n后序遍历:");
postOrder(T);
printf("\n高度:%3d",Height(T));
printf("\n节点总数:%3d",Count(T));
printf("\n请输入要删除的数:");
scanf("%d",&num);
T=deleteNode(T,num);
printf("先序遍历:");
preOrder(T);
printf("\n中序遍历:");
inOrder(T);
printf("\n后序遍历:");
postOrder(T);
printf("\n高度:%4d",Height(T));
printf("\n节点总数:%4d",Count(T));
return 0;
}