6-9 二叉树的遍历 (25分)

本题要求给定二叉树的4种遍历。

函数接口定义：

void InorderTraversal( BinTree BT );
void PreorderTraversal( BinTree BT );
void PostorderTraversal( BinTree BT );
void LevelorderTraversal( BinTree BT );

其中BinTree结构定义如下：

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

要求4个函数分别按照访问顺序打印出结点的内容，格式为一个空格跟着一个字符。

裁判测试程序样例：

#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;
}
/* 你的代码将被嵌在这里 */

输出样例（对于图中给出的树）：

Inorder: D B E F A G H C I
Preorder: A B D F E C G H I
Postorder: D E F B H G I C A
Levelorder: A B C D F G I E H

 

#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;
}
/* 你的代码将被嵌在这里 */


BinTree CreatBinTree()
{
    BinTree T = (BinTree)malloc(sizeof(struct TNode));
    T->Data = 'A';
    T->Left = NULL;
    T->Right = NULL;
    BinTree A = T;
    BinTree B = (BinTree)malloc(sizeof(struct TNode));
    B->Data = 'B';
    A->Left = B;
    BinTree C = (BinTree)malloc(sizeof(struct TNode));
    C->Data = 'C';
    A->Right = C;
    BinTree D = (BinTree)malloc(sizeof(struct TNode));
    D->Data = 'D';
    B->Left = D;
    D->Left = NULL;
    D->Right = NULL;
    BinTree F = (BinTree)malloc(sizeof(struct TNode));
    F->Data = 'F';
    B->Right = F;
    F->Right = NULL;
    BinTree G = (BinTree)malloc(sizeof(struct TNode));
    G->Data = 'G';
    C->Left = G;
    G->Left = NULL;
    BinTree I = (BinTree)malloc(sizeof(struct TNode));
    I->Data = 'I';
    C->Right = I;
    I->Left = NULL;
    I->Right = NULL;
    BinTree E = (BinTree)malloc(sizeof(struct TNode));
    E->Data = 'E';
    E->Left = NULL;
    E->Right = NULL;
    F->Left = E;
    BinTree H = (BinTree)malloc(sizeof(struct TNode));
    H->Data = 'H';
    H->Left = NULL;
    H->Right = NULL;
    G->Right = H;

    return T;
}
void InorderTraversal( BinTree BT )
{
    if(BT)
    {
        InorderTraversal(BT->Left);
        printf(" %c",BT->Data);
        InorderTraversal(BT->Right);
    }
    else return 0;

}
void PreorderTraversal( BinTree BT )
{
    if(BT)
    {
        printf(" %c",BT->Data);
        PreorderTraversal(BT->Left);
        PreorderTraversal(BT->Right);
    }
     else return 0;
}
void PostorderTraversal( BinTree BT )
{
    if(BT)
    {
        PostorderTraversal(BT->Left);
        PostorderTraversal(BT->Right);
        printf(" %c",BT->Data);
    }
     else return 0;
}
void LevelorderTraversal( BinTree BT )
{
    if(BT==NULL) return 0;
    
    BinTree a[100];
    a[0]=BT;
    int r=1,f=0;

    while(r!=f)
    {
        int p =f;
        printf(" %c",a[f++]->Data);
        if(a[p]->Left)
        {
            a[r++] = a[p]->Left;
        }
        if(a[p]->Right)
        {
            a[r++] = a[p]->Right;
        }
    }
}