离散树的递归遍历
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
struct BTNode
{
char data;
struct BTNode * pLchild;//p是指针,L是左,child是孩子;
struct BTNode * pRchild;
};//这个地方需要分号
struct BTNode * CreateBiTree();
void PreTraverseBTree(struct BTNode *pT);
void InTraverseBTree(struct BTNode *pT);
void PostTraverseBTree(struct BTNode *pT);
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main()
{
struct BTNode * pT = CreateBiTree();
printf("先序遍历是:");
PreTraverseBTree(pT);//先序遍历
printf("\n");
printf("中序遍历是:");
InTraverseBTree(pT);//中序遍历
printf("\n");
printf("后序遍历是:");
PostTraverseBTree(pT);//后序遍历
printf("\n");
return 0;
}
struct BTNode * CreateBiTree()
{
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->pRchild = pE;
pD->pLchild = NULL;
pE->pLchild = pE->pRchild = NULL;
return pA;//返回根节点的地址,将A的地址赋给pT,创造根节点
}
//先序遍历-递归
void PreTraverseBTree(struct BTNode *pT)
{
/*
伪算法
先访问根节点
在先序访问左子树
再先序访问右子树
*/
printf("%c",pT->data);//访问根节点数据
if(NULL != pT->pLchild)//若是不加if判断,结果会出错
{
//pT->pLchild可以代表整个左子树
PreTraverseBTree(pT->pLchild);
}
if(NULL != pT->pRchild)
{
PreTraverseBTree(pT->pRchild);
}
}
//中序遍历 -递归
void InTraverseBTree(struct BTNode *pT)
{
if(NULL != pT->pLchild)
{
InTraverseBTree(pT->pLchild);
}
printf("%c",pT->data);
if(NULL != pT->pRchild)
{
InTraverseBTree(pT->pRchild);
}
}
//后序遍历 -递归
void PostTraverseBTree(struct BTNode *pT)
{
if(NULL != pT->pLchild)
{
PostTraverseBTree(pT->pLchild);
}
if(NULL != pT->pRchild)
{
PostTraverseBTree(pT->pRchild);
}
printf("%c",pT->data);
}
数据结构入门,快到终点了,后面长路慢慢,感谢郝老师