16main.cpp

该程序采用结构定义二叉树结点的类型

#include "iostream.h"
#include "16.h"
void main()
{
	BTreeNode* bt;
	InitBTree(bt);
	char b[50];
	cout<<"输入以'@'字符作为结束符的二叉树广义表表示："<<endl;
	cin.getline(b,sizeof(b));
	CreateBTree(bt,b);
	PrintBTree(bt);
	cout<<endl;
	cout<<"前序：";
	TraverseBTree(bt,1);cout<<endl;
	cout<<"中序：";
    TraverseBTree(bt,2);cout<<endl;
    cout<<"后序：";
    TraverseBTree(bt,3);cout<<endl;
	cout<<"按层：";
    TraverseBTree(bt,4);cout<<endl;
	cout<<"二叉树的深度为：";
	cout<<BTreeDepth(bt)<<endl;
	cout<<"二叉树中的结点数：";
	cout<<BTreeCount(bt)<<endl;
	cout<<"二叉树的叶子结点数:";
	cout<<BTreeLeafCount(bt)<<endl;
	ClearBTree(bt);
	
	
	
}