btree.cpp

定义一个二叉树的类

//功能： 递归与非递归遍历二叉树
//#include<iostream.h>
//#include<iomanip.h>
//#include<stdlib.h>
//#include<strstrea.h>
#include"head.h"
//#include"hmain.cpp"

using namespace std;

int main()
{
	//int n;
	//char b[80]="(a)(b),c(d),e(f),g(h),i(j),k(l),m(n),o@";
	char b[80]="a(b(d,e(g,)),c(,f))@";
    BinaryTree<char> B;
    //cout<<"创建的二叉树为:"<<B.CreateBTree(b)<<endl;
	B.CreateBTree(b);
    if(!B.BTreeEmpty())
		cout<<"二叉树非空"<<endl;
    else
	    cout<<"二叉树为空"<<endl;
    //cout<<"递归中序遍历二叉树为:"<<B.TraverseBTree()<<endl;
	cout<<"递归中序遍历二叉树为:";
	B.TraverseBTree();
	cout<<endl;
    //cout<<"非递归中序遍历二叉树为:"<<InOrdere()<<endl;
	cout<<"非递归中序遍历二叉树为:";
	B.InOrder();
	cout<<endl;
	return 0;
}