遍历二叉树 c语言实现,二叉树遍历-C语言实现

#include typedef struct BTNode

{

int data;

struct BTNode *pLchild; //左孩子

struct BTNode *pRchild; //右孩子

};

void PreTraverseBTree(struct BTNode *);

struct BTNode *CreateBTree(void);

void InTraverseBTree(struct BTNode *);

void PostTraverseBTree(struct BTNode *);

int main(void)

{

struct BTNode *pT = CreateBTree();

// PreTraverseBTree(pT);

// InTraverseBTree(pT);

PostTraverseBTree(pT);

return 0;

}

void PreTraverseBTree(struct 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(struct 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(struct BTNode *pT)

{

if (NULL != pT)

{

if (NULL != pT->pLchild)

{

PostTraverseBTree(pT->pLchild);

}

if (NULL != pT->pRchild)

{

PostTraverseBTree(pT->pRchild);

}

printf("%c\n", 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));

//struct BTNode *pA =(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;

};