二叉树层次遍历的问题

Question

想问一下这段代码的错误，要怎么修改呢？这是二叉树的层次遍历。
树的结构定义为

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

层次遍历

#define Max 100
void LevelorderTraversal( BinTree BT ){
    int Q[Max];
    int f,r;
    f=r=0;
    Q[r++]=BT;
    BinTree T=NULL;
    while(f<r){
        T=Q[f++];
        printf("%d",T->Data);
        if(BT->Left){
            Q[r++]=T->Left;
        }
        if(BT->Right){
            Q[r++]=T->Right;
        }
    }
}

Answer 1

修改如下，改动处见注释，供参考：

typedef int ElementType;

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

#define Max 100
void LevelorderTraversal(BinTree BT){
    BinTree Q[Max]; //int Q[Max];  修改
    int f,r;
    f=r=0;
    if (!BT)  return;//二叉树为空  修改
    BinTree T = BT;  //修改
    Q[r++] = T;
    while(f < r){
        T=Q[f++];
        printf("%d ",T->Data);
        if(BT->Left){
            Q[r++]=T->Left;
        }
        if(BT->Right){
            Q[r++]=T->Right;
        }
    }
}