bl.cpp

数据结构基础代码

//三种遍历二叉树的递归
#include <iostream.h>
#include "bl.h"
bitree t;
void main()
{	
	int circle=1;
	int choice;
	
	cout<<"选择操作:"<<endl;
	cout<<"=============================================================="<<endl;
	cout<<"1.创建一个二叉树"<<endl;
	cout<<"2.先序遍历二叉树元素"<<endl;
	cout<<"3.中序遍历二叉树元素"<<endl;
	cout<<"4.后序遍历二叉树元素"<<endl;
	cout<<"5.退出"<<endl;
	while(circle)
	{
		
		cout<<"请选择要执行的操作(1/2/3/4/5/6):"<<endl;
		cin>>choice;

		switch(choice)
		{
		case 1:
			cout<<"选择的操作是创建一个二叉树(字符型)"<<endl;
			createbitree(t);
			cout<<"创建完毕!"<<endl;
			break;
		case 2:
			cout<<"先序遍历的结果为:"<<endl;
			preorder(t);
			break;
		case 3:
			cout<<"中序遍历的结果为:"<<endl;
			inorder(t);
			break;
		case 4:
			cout<<"后序遍历的结果为:"<<endl;
			postorder(t);
			break;
		case 5:
			circle=0;
			break;
		}
		cout<<"===========================================================";
	}
}