main.cpp

使用中序遍历

#include"BTree.h"

int main(){
	BTree<char> d,e,f,b,c,a,left,right;

	d.MakeTree('D',left,right);
	e.MakeTree('E',left,right);
	f.MakeTree('F',left,right);
	b.MakeTree('B',left,d);
	c.MakeTree('C',e,f);	//先叶子，再根节点。
	a.MakeTree('A',b,c);

	a.PreOrder(Visit);
	cout<<endl;
	a.InOrder(Visit);
	cout<<endl;
	a.PostOrder(Visit);
	cout<<endl;
	a.Exch();
	cout<<"节点的个数为:";
	cout<<a.Size();
	cout<<'\n'<<"later"<<endl;
	a.PreOrder(Visit);
	cout<<endl;
    a.InOrder(Visit);
	cout<<endl;
    a.PostOrder(Visit);
 	cout<<endl;
	cout<<"二叉树的高度为:";
	cout<<a.High();
	cout<<endl;
	return 0;
	
	}