郝斌老师【数据结构入门】之二叉树程序演示

66 阅读 0 评论 44 点赞

我是靠谱客的博主会撒娇指甲油，最近开发中收集的这篇文章主要介绍郝斌老师【数据结构入门】之二叉树程序演示，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

需要创建的二叉树如图：
在这里插入图片描述

#include<stdio.h>
#include<malloc.h>

struct BTNode
{
	char data;
	struct BTNode * pLchild;
	struct BTNode * pRchild;
};

struct BTNode * CreateBTree(void);

void PreTraverseBTree(struct BTNode *);
void InTraverseBTree(struct BTNode *);
void PostTraverseBTree(struct BTNode *);

int main(void)
{
	BTNode * pT = CreateBTree();

	//先序遍历
	PreTraverseBTree(pT);

	//中序遍历
	InTraverseBTree(pT);

	//后续遍历
	PostTraverseBTree(pT);

	return 0;
}

//先序遍历
void PreTraverseBTree(struct BTNode *pT)
{
	/*先访问根结点
	再先序访问左子树
	再先序访问右子树*/

	if (pT != NULL)
	{
		printf("%cn", pT->data);

		if (NULL != pT->pLchild)
		{
			PreTraverseBTree(pT->pLchild);
		}
		
		if (NULL != pT->pRchild)
		{
			PreTraverseBTree(pT->pRchild);

		}
	}
}

//中序遍历
void InTraverseBTree(struct BTNode *pT)
{
	

	if (pT != NULL)
	{
		

		if (NULL != pT->pLchild)
		{
			InTraverseBTree(pT->pLchild);
		}

		printf("%cn", pT->data);

		if (NULL != pT->pRchild)
		{
			InTraverseBTree(pT->pRchild);

		}
	}
}

//后序遍历
void PostTraverseBTree(struct BTNode *pT)
{
	

	if (pT != NULL)
	{

		if (NULL != pT->pLchild)
		{
			PostTraverseBTree(pT->pLchild);
		}

		if (NULL != pT->pRchild)
		{
			PostTraverseBTree(pT->pRchild);

		}

		printf("%cn", pT->data);
	}
}

//静态创建二叉树
struct BTNode * CreateBTree(void)
{
	struct BTNode * pA = (struct BTNode * )malloc(sizeof(struct BTNode));
	struct BTNode * pB = (struct BTNode *)malloc(sizeof(struct BTNode));
	struct BTNode * pC = (struct BTNode *)malloc(sizeof(struct BTNode));
	struct BTNode * pD = (struct BTNode *)malloc(sizeof(struct BTNode));
	struct BTNode * pE = (struct BTNode *)malloc(sizeof(struct BTNode));

	pA->data = 'A';
	pB->data = 'B';
	pC->data = 'C';
	pD->data = 'D';
	pE->data = 'E';

	pA->pLchild = pB;
	pB->pLchild = pB->pRchild = NULL;
	pA->pRchild = pC;
	pC->pLchild = pD;
	pC->pRchild = NULL;
	pD->pLchild = NULL;
	pD->pRchild = pE;
	pE->pLchild = pE->pRchild = NULL;

	return pA;
}