二叉树（静态）（遍历）

<img src="https://img-blog.csdn.net/20150723142241734?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />

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

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

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

int main()
{
    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));

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