tree.cpp

中序遍历输出二叉树 输出二叉树的叶子树 输出二叉树的节点数

#include"TREE.h"
void main()
{	
	char sel;
	do
	{	
		system("cls");
		char s[50];
	    BTreeNode *tree;
	    cout<<"输入二叉树,以@结束:";
	    cin.getline(s,sizeof(s));
	    //cin.getline(s,sizeof(s)); //如果不能输入添加此行
	    CreateBTree(tree,s);
	    int sum=0,leaves=0;
	    cout<<endl;
	    cout<<endl<<"中序遍历:"<<' ';
	    fun(tree,sum,leaves);
	    cout<<endl;
	    cout<<endl<<"节点总数为:"<<sum<<endl;
	    cout<<endl<<"叶子总数为:"<<leaves<<endl;
		cout<<endl<<"是否继续?(输入y继续,任意键退出):";
		cin>>sel;
	}while(sel=='y');
}