binary.cpp

来自「二叉排序树的建立」· C++ 代码 · 共 57 行

#include"bintree.h"
void print()
{
	cout<<endl
		<<"请选择你要进行的操作(1~4)"<<endl
		<<"1.	显示树"<<endl
		<<"2.	插入一个节点"<<endl
		<<"3.	寻找一个节点"<<endl
		<<"4.	删除一个节点"<<endl;
}
void main()
{
	BiSortTree tree;
    int number;
	int choiceNumber;
    char flag;
	while(1)
	{
       print();
	   cout<<"你的选择为:";
	   cin>>choiceNumber;
	   switch(choiceNumber)
	   {
	   case 1:
			  tree.displayTree();break;
		  case 2:
			  cout<<"请输入要插入的数: ";
			  cin>>number;
			  tree.insertTree(number);
			  cout<<"插入成功."<<endl;
			  tree.displayTree();break;
		  case 3:
			  cout<<"请输入你要查找的数: ";
			  cin>>number;
			  if(tree.searchTree(number)==NULL)
			  {
				  cout<<"查找失败."<<endl;
			  }
                  else
				  {
					  cout<<"查找成功."<<endl;
				  }break;
		  case 4:
			  cout<<"请输入你要删除的数: ";
			  cin>>number;
			  tree.deleteTree(number);
			  tree.displayTree();break;
		  default:cout<<"输入有误，请重新选择："<<endl;
	   }
	   cout<<"你是否要继续(Y/N)?"<<endl;
	   cin>>flag;
	   if(flag=='Y'||flag=='y')continue;
	   if(flag=='N'||flag=='n')break;
	   else cout<<"输入有误，跳过"<<endl;
	}
}