二叉树的遍历（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 0;
}
/* 你的代码将被嵌在这里 */
#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 0;
}
/* 你的代码将被嵌在这里 */
void InorderTraversal( BinTree BT )
{
    if(BT == NULL){
        return ;
    }
    InorderTraversal(BT->Left);
    printf(" %c",BT->Data);
    InorderTraversal(BT->Right);
}
void PreorderTraversal( BinTree BT )
{
    if(BT == NULL){
        return ;
    }
    printf(" %c",BT->Data);
    PreorderTraversal(BT->Left);

    PreorderTraversal(BT->Right);
}
void PostorderTraversal( BinTree BT )
{
    if(BT == NULL){
        return ;
    }
    PostorderTraversal(BT->Left);

    PostorderTraversal(BT->Right);
    printf(" %c",BT->Data);
}
void LevelorderTraversal( BinTree BT )
{
    BinTree q[100];
    BinTree p;
    int l = 0,r = 0;
    if(!BT)
        return;
    if(BT)
    {
        q[r++] = BT;
        while(l != r)
        {
            p = q[l++];
            printf(" %c",p->Data);
            if(p->Left)
            {
                q[r++] = p->Left;
            }
            if(p->Right)
            {
                q[r++] = p->Right;
            }

        }
    }
}