遍历输出 链式二叉树 先序 中序 后序

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

// 链式二叉树
struct  BTNode
{
    int data;
    struct BTNode * pLchild;// p-指针 L-左
    struct BTNode * pRchild;
};

struct BTNode * CreateBTree(void);
void PreTraverseBTree(struct  BTNode * pT);
void INTraverseBTree(struct  BTNode * pT);
void PostTraverseBTree(struct  BTNode * pT);

int main(void)
{
    struct BTNode * pT = CreateBTree();// 生成二叉树,返回根节点地址
    PreTraverseBTree(pT);// 先序    ABCDE
    INTraverseBTree(pT);// 中序    BADEC
    PostTraverseBTree(pT);// 后序   BEDCA 
    return 0;
}

// 先序
void PreTraverseBTree(struct  BTNode * pT)
{
    if (NULL != pT)
    {
        printf("pre: %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("in: %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("post: %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));

    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;
}