bithreadtree.cpp

二叉树的中序线索化

// BiThreadTree.cpp : Defines the entry point for the console application.
//


#include "stdafx.h"
#include "stdio.h"
#include "stdlib.h"
#include "vld.h"
#include "..\header\BiThrTree.h"

int main(int argc, char* argv[])
{
	BiThrTree root,Thrt;

	printf("按先序序列输入二叉树各结点(ex. ABC##DE#G##F###):\n");
	CreatBinTree(root);
	
	InOrderThreading(Thrt,root);
	printf("中序法遍历线索化二叉树：\n");

	InOrderTraverse_Thr(Thrt, Visit); 

	DestroyBinTree(root);
	
	if(Thrt)
	{
		free(Thrt);
		Thrt = NULL;
	}
	system("Pause");
	return 0;
}