main.cpp

二叉排序树的所有功能

#include "Tree_Structure.h"
int main(){
	int choice=0,flag=1,_key;
	struct tree *p=NULL;
//	cout<<M<<endl;
//	p=_init_tree();
//	inorder_layer(p);
	
		cout<<"****************************"<<endl;
		cout<<"****************************"<<endl;
	for(;flag;){	
		cout<<"*1、节点插入               *"<<endl;
		cout<<"*2、节点删除               *"<<endl;
		cout<<"*3、学生节点删除           *"<<endl;
		cout<<"*4、中序列表               *"<<endl;
		cout<<"*5、层次列表               *"<<endl;
		cout<<"*6、检索                   *"<<endl;
		cout<<"*7、总数统计               *"<<endl;
		cout<<"*8、均值、最大最小值、方差 *"<<endl;
		cout<<"*9、二叉树存盘             *"<<endl;
		cout<<"*10、二叉树恢复            *"<<endl;
		cout<<"*11、中序线索化            *"<<endl;
		cout<<"*其他、退出                *"<<endl;
		cout<<"************请选择**********"<<endl;
		choice=0;
		fflush(stdin);
		cin>>choice;
		switch(choice)
		{
		case 1:
			p=_init_tree();
			break;
		case 2:
			cout<<"请输入你要删除的关键码"<<endl;
			_key=0;
			cin>>_key;
			p=removehelp(p,_key);
			break;
		case 3:
			cout<<"请输入你要删除的学号"<<endl;
			char num[10];
			cin>>num;
			p=remove_stu(p,num);
			break;
		case 4:
			inorder(p);
			break;
		case 5:
			inorder_layer(p);
			break;
		case 6:
			if(!p){cout<<"空指针"<<endl;break;}
			search_path(p);
			break;
		case 7:
			
			cout<<"学生总数为:"<<_get_sum(p)<<endl;
			break;
		case 8:
			cout<<"均值、方差分别为："<<endl;
			cout<<average(p)<<"、"<<fch(p)<<endl;
			_Max_Min(p);
			break;
		case 9:
			save_tree(p);
			break;
		case 10:
			p=load_tree(p);
//			cout<<"Final"<<endl;
			break;
		case 11:
			inorder_clew(p);
			flag=0;//中序之后，不适合其他函数
			break;
		default:
			flag=0;
			break;
		}
	
	}
		cout<<"****************************"<<endl;
		cout<<"*         程序结束         *"<<endl;
		cout<<"****************************"<<endl;
	cin>>choice;//为了让程序停下来看一下
	return 0;
}