binarytreetraverse main.cpp

来自「二叉树的遍历操作」· C++ 代码 · 共 30 行

#include"Operater Declare.h"

void main()
{
	BinTree t;
	printf("输入树的数据序列：\n");	
	CreateBinTree(t);
	printf("递归先序遍历二叉树的序列为：\n");
	PreOrderTraverse(t);
	printf("\n");
	printf("递归中序遍历二叉树的序列为：\n");
	InOrderTraverse(t);
	printf("\n");
	printf("递归后序遍历二叉树的序列为：\n");
	PostOrderTraverse(t);
	printf("\n");
	printf("层次遍历二叉树的序列为：\n");
	LevelOrderTraverse(t);
	printf("\n");
	printf("非递归先序遍历二叉树的序列为：\n");
	PreOrderTraverseRE(t);
	printf("\n");
	printf("非递归中序遍历二叉树的序列为：\n");
	InOrderTraverseRE(t);
	printf("\n");
	printf("非递归后序遍历二叉树的序列为：\n");
	PostOrderTraverseRE(t);
	printf("\n");
}