bitreemain.cpp

二叉树的实现代码 前序遍历 中序遍历 后序遍历

#include<iostream.h>
#include"head.h"

	

void main()
{
	BiTree pTree;
	InitBiTree(pTree);
	
	SqStack S2;
    InitStack(S2);
	
	cout<<"输入元素，构建一课树：\n";
	CreateTree(pTree);//构建一棵树，输入次序为abd##e##cf##g##
	
	cout<<"测试先序先序遍历:\n";
	PreOrderTraval(pTree);
	cout<<endl<<endl;
	
	cout<<"测试“递归”中序遍历：\n";
	InOrderTraval(pTree);
	cout<<endl<<endl;

	cout<<"测试后序遍历：\n";
	PostOrderTraval(pTree);
	cout<<endl<<endl;

	cout<<"测试非“递归”中序遍历：\n";
	InOrderTraverse(pTree,Visit);
	cout<<endl<<endl;

	cout<<"测试二叉树的叶子数目：\n";
	cout<<BiLeafCount(pTree);
    cout<<endl<<endl;
	
	 cout<<"测试二叉树的深度：\n";
	cout<<BiTreeDepth(pTree);
	cout<<endl<<endl;

    cout<<"测试输出根到叶子路径：\n";
	AllPath(pTree,S2);
    cout<<endl<<endl;
}