04-树7 二叉搜索树的操作集 (30分)

#include<iostream>  
using namespace std;  
 
typedef int ElemType;
struct BTNode{ //树的结点   
    ElemType data;  
    BTNode * lchild;  
    BTNode * rchild;  
};  

void Preorder(BTNode * T,bool flag){
	if(!T) return ;
	if(!flag) flag=true;
	else cout<<" ";
	cout<<T->data;
	Preorder(T->lchild,true);
	Preorder(T->rchild,true);
}


void Inorder(BTNode * T){	//此法导致最后一个节点后面有一个空格 
	if(!T) return ;
	Inorder(T->lchild);
	cout<<T->data<<" ";
	Inorder(T->rchild);	
	
} 

BTNode * Find(BTNode * T,ElemType x){
	if(!T) return NULL; 
	else if(x==T->data) return T;
	else if(x < T->data) return Find(T->lchild,x);		
	else if(T->lchild)  return Find(T->rchild,x);	
}  
  
  
BTNode * FindMin(BTNode * T){
	if(T){
		if(T->lchild) return FindMin(T->lchild);
		return T;
	}else{
		return NULL;
	} 	
}


BTNode * FindMax(BTNode * T){
	if(T){
		if(T->rchild) return FindMax(T->rchild);
		return T;
	}else{
		return NULL;
	} 		
}

   
BTNode * Insert(BTNode * T,ElemType x){
	if(!T){
		T=new BTNode; 
		T->data=x;
		T->lchild=T->rchild=NULL;
	}else{
		if(x<T->data)  T->lchild=Insert(T->lchild,x);
		else if(x>T->data)   T->rchild=Insert(T->rchild,x);
		else ;//已经存在，不必操作 
	}	
	return T;
}
  
  
BTNode * Delete(BTNode * T,ElemType x){
	BTNode * temp;	
	if(!T){
		cout<<"Not Found"<<endl;	
		return T; 
	}
	
	if(x<T->data)  T->lchild=Delete(T->lchild,x);
	else if(x>T->data)  T->rchild=Delete(T->rchild,x);
	else{
		if(T->lchild && T->rchild){//要么找左子树最大的，要么找右子树最小的 
			temp=FindMin(T->rchild); 
			T->data=temp->data;   
			T->rchild=Delete(T->rchild,T->data); 
		}else{	
			 temp=T;
			 if(!T->lchild)  T=T->rchild;
			 else if(!T->rchild)  T=T->lchild;
			 else ;
			 delete(temp);
		}		
	}
	return T;	
}  
 
 

 
  
int main()  
{  
	//freopen("input.txt","r",stdin);
	BTNode * T,* T1,* T2,* Min,* Max;//千万注意，这里全是野指针，用时要赋值 
	int n,n1,n2;
	ElemType x;
	
	//n个插入 
	T=NULL;//很重要 
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>x;
		T=Insert(T,x);
	}

	//先序遍历	 
	cout<<"Preorder:"; Preorder(T,false); cout<<endl;
	
	//查找最小节点和最大节点 	
	Min=FindMin(T);
	Max=FindMax(T);
	 
	//n1个查找 
	cin>>n1;
	for(int i=0;i<n1;i++){
		cin>>x;
		T1=Find(T,x);
		if(!T1) cout<<x<<" is not found"<<endl;
		else{
			cout<<x<<" is found"<<endl;
			if(T1==Min) cout<<x<<" is the smallest key"<<endl;
			if(T1==Max) cout<<x<<" is the largest key"<<endl;
		}	
	}
	
	//n2个删除
	cin>>n2;
	for(int i=0;i<n2;i++){
		cin>>x;
		T2=Delete(T,x);
		//cout<<"Inorder:"; Inorder(T2); cout<<endl; 
	} 
	
	//中序遍历
	cout<<"Inorder:"; Inorder(T2); cout<<endl; 
	
    return 0;  
} 

本题要求实现给定二叉搜索树的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;
}
/* 你的代码将被嵌在这里 */

输入样例：

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