C语言实现树的前序遍历,中序遍历和后序遍历

最新推荐文章于 2023-04-14 11:51:25 发布

专注做好一件事

最新推荐文章于 2023-04-14 11:51:25 发布

阅读量1k

点赞数

分类专栏：数据结构文章标签：数据结构二叉树

本文链接：https://blog.csdn.net/qq_36416905/article/details/109964046

版权

数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
struct BTNode
{
	int data;
	struct BTNode* pLchild;//p是指针 L是左 child是孩子
	struct BTNode* pRchild;//Rchild右孩子
};
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;
	pA->pRchild = pC;
	pB->pLchild = pB->pRchild = NULL;
	pC->pLchild = pD;
	pC->pRchild = NULL;
	pD->pLchild = NULL;
	pD->pRchild = pE;
	pE->pLchild = pE->pRchild = NULL;
	return pA;
};
void PreTraverseBTree(BTNode* pT) {
	//先访问根  再访问左子树 再访问右子树 递归
	if (NULL!=pT)
	{
		printf("%c\n", pT->data);
		if (NULL != pT->pLchild)
		{
			PreTraverseBTree(pT->pLchild); //代表左子树
		}
		if (NULL!=pT->pRchild)
		{
			PreTraverseBTree(pT->pRchild);  //代表右子树
		}
	}	
}
void InTraverseBTree(BTNode* pT) {
	if (NULL != pT)
	{
		if (NULL != pT->pLchild)
		{
			InTraverseBTree(pT->pLchild); //代表左子树
		}
		printf("%c\n", pT->data);
		if (NULL != pT->pRchild)
		{
			InTraverseBTree(pT->pRchild);  //代表右子树
		}
	}
}
void PostTraverseBTree(BTNode* pT) {
	if (NULL != pT)
	{
		if (NULL != pT->pLchild)
		{
			PostTraverseBTree(pT->pLchild); //代表左子树
		}
		
		if (NULL != pT->pRchild)
		{
			PostTraverseBTree(pT->pRchild);  //代表右子树
		}
		printf("%c\n", pT->data);
	}
}
int main() {
	struct BTNode* pT = CreateBTree();//函数内部动态创建二叉树 返回根节点地址（省空间）
	PreTraverseBTree(pT);//先序
	printf("\n");
	InTraverseBTree(pT);//中序
	printf("\n");
	PostTraverseBTree(pT);//后序
	return 0;
}