test.cpp

来自「二叉树的实现」· C++ 代码 · 共 40 行

//测试4到11题的功能实现
//有关二叉树的实现在bitree.cpp中
//有关树的实现在Tree.cpp中
#include <stdio.h>
typedef char TElemType;
#include "BiTree.cpp"
typedef char ElemType; 
#include "Tree.cpp"
//测试所写函数的正确性
int main()
{//测试二叉树定义的实现
	BiTree T;
	char ch[]="AB.D..CE..F..";
	printf("二叉树测试\n");
	printf("先序扩展序列为：%s\n",ch);
	CreateBiTree(T,ch);
	printf("先序遍历为：");
	PreOrderTraverse1(T,PrintElement);
	printf("\n");
	printf("中序遍历为：");
	InOrderTraverse1(T,PrintElement);
	printf("\n");
	printf("后序遍历为：");
	PostOrderTraverse1(T,PrintElement);
	printf("\n");
	printf("层次遍历为：");
	LevelOrderTraverse(T,PrintElement);
	printf("\n");
	printf("二叉树深度为：%d\n",BiTreeDepth(T));
	DestroyBiTree(T);
	//测试TreeDepth（）
	CSTree T1;
	TElemType ch1[]="AB.CD..E...";
	printf("树测试\n");
	printf("先序扩展序列为：%s\n",ch1);
	CreateTree(T1,ch1);
	printf("树的深度为：%d\n",TreeDepth(T1));
	DestroyTree(T1);
	return OK;
}