数据结构——二叉树的遍历

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

#define OVERFLOW 0
typedef char Elemtype;
typedef struct TreeNode
{
    Elemtype data;
    struct TreeNode *Lchild;
    struct TreeNode *Rchild;
} TreeNode,*BiTree;

void CreateBiTree(BiTree *T)
{
    char ch;
    scanf("%c",&ch);
    if(ch == '#')
        *T = NULL;
    else
    {
        *T = (BiTree)malloc( sizeof(TreeNode) );
        if(!*T)
            exit(OVERFLOW);
        (*T)->data = ch;
        CreateBiTree(&(*T)->Lchild);
        CreateBiTree(&(*T)->Rchild);

    }
}
void PreOrderTraverse(BiTree T)
{
    if(T == NULL)
        return ;
    printf("%c",T->data);
    PreOrderTraverse(T->Lchild);
    PreOrderTraverse(T->Rchild);
}

void InOrderTraverse(BiTree T)
{
    if(T == NULL)
        return ;
    InOrderTraverse(T->Lchild);
    printf("%c",T->data);
    InOrderTraverse(T->Rchild);
}
void PostOrderTraverse(BiTree T)
{
    if(T == NULL)
        return ;
    PostOrderTraverse(T->Lchild);
    PostOrderTraverse(T->Rchild);
    printf("%c",T->data);
}
int main()
{
    BiTree T;
    CreateBiTree(&T);
    PreOrderTraverse(T);
    printf("
");
    InOrderTraverse(T);
    printf("
");
    PostOrderTraverse(T);
    printf("
");
    return 0;
}