数据结构课程设计（二叉树的遍历）

#include "iostream" #include "BiTree.h" using namespace std; void main() { BiTree<char> Tree(1); while(1){ cout<<"\t\t 欢迎使用本系统!! "<<endl; cout<<"\t\t######################################## "<<endl; cout<<"\t\t# # "<<endl; cout<<"\t\t# 1--创建一颗二叉树并显示 # "<<endl; cout<<"\t\t# 2--遍历二叉树 # "<<endl; cout<<"\t\t# 3--查询二叉树的深度和结点数 # "<<endl; cout<<"\t\t# 4--查询每层结点数 # "<<endl; cout<<"\t\t# 5--查找两节点P和Q的最近共同祖先 # "<<endl; cout<<"\t\t# 6--退出 # "<<endl; cout<<"\t\t# # "<<endl; cout<<"\t\t######################################## "<<endl; cout<<"请输入你的选择："; char ch; cin>>ch; switch(ch){ case '1':{ cout<<"请输入二叉树的前序遍历："<<endl; cout<<"（以#作为分支结尾，例如：AB##C##）"<<endl; Tree.creat(); cout<<Tree; cout<<endl; }break; case '2':{ cout<<endl; cout<<"前序遍历为："; Tree.PreOrder(); cout<<endl; cout<<"中序遍历为："; Tree.inorder(); cout<<endl; cout<<"后序遍历为："; Tree.PostOrder(); cout<<endl; cout<<"层序遍历为："; Tree.levelorder(); cout<<endl; cout<<endl; }break; case '3': { cout<<"树的深度为："<<Tree.depth()<<endl; cout<<"树的结点数："<<Tree.count()<<endl; cout<<endl; }break; case '4':{ Tree.LevelNum(); cout<<endl; }break; case '5':{ char ch1,ch2; cout<<"请输入P数据信息："; cin>>ch1; cout<<"请输入Q数据信息："; cin>>ch2; cout<<ch1<<"和"<<ch2<<"的最近共同祖先是"<<Tree.leastCommanAncestor(ch1,ch2)<<endl; cout<<endl; }break; case '6':return;break; default: cout<<"请输入正确的选择！！！"<<endl;break; } } }