二叉树遍历递归方式实现

2018.11.15

前序遍历：根->左->右

中序遍历：左->根->右

后序遍历：左->右->根

//二叉树遍历递归方式实现
//2018.11.15 青春如诗
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef char ElementType;
typedef struct TreeNode *BinTree;
typedef BinTree Position;
struct TreeNode
{
	ElementType Data;
	BinTree Left;
	BinTree Right;
};
//判断二叉树是否为空
bool IsEmpty(BinTree BT)
{
	return BT==NULL;
}
//创建节点
BinTree CreateTreeNode(char ch)
{
	BinTree BT = (BinTree)malloc(sizeof(struct TreeNode));
	BT->Data=ch;
	BT->Left = NULL;
	BT->Right = NULL;
	return BT;
}
//创建二叉树
BinTree CreateBinTree()
{
	BinTree BT = CreateTreeNode('A');

	BT->Left = CreateTreeNode('B');

	BT->Right = CreateTreeNode('C');
	
	BT->Left->Left = CreateTreeNode('D');
	BT->Left->Right = CreateTreeNode('F');
	BT->Right->Left = CreateTreeNode('G');
	BT->Right->Right = CreateTreeNode('I');
	BT->Left->Right->Left = CreateTreeNode('E');
	BT->Right->Left->Right = CreateTreeNode('H');
	return BT;
}


void DeleteTree(BinTree *BT)
{
	if (*BT)
	{
		DeleteTree(&((*BT)->Left));
		DeleteTree(&((*BT)->Right));
		*BT = NULL;
		free(*BT);
	}
}

//先序遍历
void PreOrderTraversal(BinTree BT)
{
	if (BT)
	{
		printf("%c->", BT->Data);
		PreOrderTraversal(BT->Left);
		PreOrderTraversal(BT->Right);
	}
}
//中序遍历
void InOrderTraversal(BinTree BT)
{
	if (BT)
	{
		InOrderTraversal(BT->Left);
		printf("%c->", BT->Data);
		InOrderTraversal(BT->Right);
	}
}
//后序遍历
void PostOrderTraversal(BinTree BT)
{
	if (BT)
	{
		PostOrderTraversal(BT->Left);
		PostOrderTraversal(BT->Right);
		printf("%c->", BT->Data);
	}
}

int main()
{
	BinTree BT = CreateBinTree();
	printf("先序遍历：\n");
	PreOrderTraversal(BT);
	printf("\n后序遍历:\n");
	InOrderTraversal(BT);
	printf("\n后序遍历:\n");
	PostOrderTraversal(BT);
	DeleteTree(&BT);
	return 0;
}