正确实现二叉树层次遍历的算法

#include <stdio.h> 
#include <stdlib.h> 
#define TRUE  1 
#define FALSE  0 
#define OK  1 
#define ERROR 0 
#define INFEASIBLE  -1 
#define OVERFLOW  -2 
typedef int Status; 
typedef char TElemType; 
typedef char QElemType; 

typedef struct BiTNode 
{ 
    TElemType data; 
    struct BiTNode *lchild,*rchild; 
}BiTNode,*BiTree; 

typedef struct QNode 
{ 
    BiTree data; 
    struct QNode *next; 
}QNode,*QueuePtr; 


typedef struct 
{ 
    QueuePtr front;    //队头指针 
    QueuePtr rear;      //队尾指针 
}LinkQueue;