数据结构：链式二叉树

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

struct BTNode
{
    int data;
    struct BTNode * pLchild;   //指向左边子节点的指针域
    struct BTNode * pRchild;   //指向右边子节点的指针域
};

struct BTNode * CreateBTree();
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(pT!=NULL){
        printf("%c\n",(*pT).data);
        //pT->pLchile代表整个左子树

        if(pT->pLchild!=NULL)
            PreTraverseBTree(pT->pLchild);
        if(pT->pRchild!=NULL)
            PreTraverseBTree(pT->pRchild);
    }
    return ;
}

//中序遍历
void InTraverseBTree(struct BTNode * pT)
{
    if(pT!=NULL){
        //pT->pLchile代表整个左子树

        if(pT->pLchild!=NULL)
            InTraverseBTree(pT->pLchild);

        printf("%c\n",(*pT).data);

        if(pT->pRchild!=NULL)
            InTraverseBTree(pT->pRchild);
    }
    return ;
}

//后序遍历
void PostTraverseBTree(struct BTNode * pT)
{
    if(pT!=NULL){
        //pT->pLchile代表整个左子树

        if(pT->pLchild!=NULL)
            PostTraverseBTree(pT->pLchild);

        if(pT->pRchild!=NULL)
            PostTraverseBTree(pT->pRchild);

        printf("%c\n",(*pT).data);
    }
    return ;
}

struct BTNode * CreateBTree()
{
    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;
}