main.cpp

前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历

#include"PreTBTree.h"
#include"InTBTree.h"
#include"PostTBTree.h"
void main(){

	while(1){
		cout<<endl;
	
		cout << "     =======================二叉线索树====================\n";
		cout << "                                      \n";
		cout << "       0:---- 出口"<<endl;
		cout << "       1:---- 前序线索二叉树的前序遍历"<<endl;
		cout << "       2:---- 中序线索二叉树的中序遍历"<<endl;
		cout << "       3:---- 后序线索二叉树的后序遍历"<<endl;
		cout << "     =====================================================\n";
		cout << "请选择0/1/2/3: ";
		int input;
		cin>>input;
		switch(input){
		case 0:	
			cout<<"再见"<<endl;
			cout << "                                      \n";
			exit(-1);
			break;
		case 1:choice1();break;
		case 2:choice2();break;
		case 3:choice3();break;
		}
    
	cout<<endl;
    system("pause");
    system("cls");
	}}