二叉树的遍历（25 分）

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

typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

BinTree CreatBinTree(); /* 实现细节忽略 */
void InorderTraversal( BinTree BT );
void PreorderTraversal( BinTree BT );
void PostorderTraversal( BinTree BT );
void LevelorderTraversal( BinTree BT );

int main()
{
    BinTree BT = CreatBinTree();
    printf("Inorder:");    InorderTraversal(BT);    printf("\n");
    printf("Preorder:");   PreorderTraversal(BT);   printf("\n");
    printf("Postorder:");  PostorderTraversal(BT);  printf("\n");
    printf("Levelorder:"); LevelorderTraversal(BT); printf("\n");
    return ;
}
void InorderTraversal( BinTree BT ){
    if(BT){
        InorderTraversal(BT->Left);
        printf(" %c",BT->Data);
        InorderTraversal(BT->Right);
    }
}
void PreorderTraversal( BinTree BT ){
    if(BT){
        printf(" %c",BT->Data);
        PreorderTraversal(BT->Left);
        PreorderTraversal(BT->Right);
    }
}
void PostorderTraversal( BinTree BT ){
    if(BT){
        PostorderTraversal(BT->Left);
        PostorderTraversal(BT->Right);
        printf(" %c",BT->Data);
    }
}
void LevelorderTraversal( BinTree BT ){
    BinTree q[100];
    int head=,tail=;
    if(BT)
        q[tail++]=BT;
    BinTree tmp;
    while(head<=tail-){
        tmp = q[head++];
        printf(" %c",tmp->Data);
        if(tmp->Left)
            q[tail++]=tmp->Left;
        if(tmp->Right)
            q[tail++]=tmp->Right;
    }
}
BinTree CreatBinTree(){
    BinTree BT[];
    int i;
    for(i=;i<;i++) {
        BT[i]=(BinTree)malloc(sizeof(struct TNode));
        BT[i]->Data=(char)(+i);
    }
    BT[]->Left=BT[];
    BT[]->Right=BT[];
        BT[]->Left=BT[];
    BT[]->Right=BT[];
        BT[]->Left=BT[];
    BT[]->Right=BT[];
        BT[]->Left=NULL;
    BT[]->Right=NULL;
        BT[]->Left=NULL;
    BT[]->Right=NULL;
        BT[]->Left=BT[];
    BT[]->Right=NULL;
        BT[]->Left=NULL;
    BT[]->Right=BT[];
        BT[]->Left=NULL;
    BT[]->Right=NULL;
        BT[]->Left=NULL;
    BT[]->Right=NULL;
    return BT[];
}