按层序遍历顺序生成二叉树

#include<stdio.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
#define Yes 1
#define No 0
typedef short ElemType;
typedef short Status;
struct BiTreeNode/* 二叉树结点定义 */
{
    ElemType data;
    struct BiTreeNode *LChild;/* 左孩子指针 */
    struct BiTreeNode *RChild;/* 右孩子指针 */
};
struct QueueNode/* 链队列结点 */
{
    struct BiTreeNode *pointer;/* 存储二叉树的根结点地址 */
    struct QueueNode *next;
};
struct QueueInfo/* 链队列信息结点 */
{
    QueueNode *Qfront;/* 队头指针 */
    QueueNode *Qrear;/* 队尾指针 */
};
/* */
Status InitQueue(QueueInfo* &Q_Info);
Status EnQueue(QueueInfo* &Q_Info, BiTreeNode *T);
Status DeQueue(QueueInfo* &Q_Info, BiTreeNode* &T);
Status QueueEmpty(QueueInfo* &Q_Info);
short GetQueueLength(QueueInfo* &Q_Info);
BiTreeNode* GetQueueTop(struct QueueInfo* &Q_Info);
short DepthNotRecursion(BiTreeNode* &T);
int GetSumTheDeepestLevel(BiTreeNode* &T, short depth);
Status CreateBiTreeLevelTraverse(BiTreeNode* &T);
Status LevelTraverse(BiTreeNode* &T);
/* */
int main()
{
    BiTreeNode *root;/* 树根指针 */
    BiTreeNode *copy_root;/* 二叉树复制品的根指针 */
    CreateBiTreeLevelTraverse(root);
    LevelTraverse(root);
    return 0;
}
/* 按层序遍历顺序创建二叉树 */
Status CreateBiTreeLevelTraverse(BiTreeNode* &T)
{
    ElemType ch;
    struct QueueInfo *Q_Info;
    struct BiTreeNode *p;
    InitQueue(Q_Info);
    fscanf(stdin, "%hd", &ch);
    if(ch != 0)
    {
        T = (struct BiTreeNode*)malloc(sizeof(struct BiTreeNode));
        if(T == NULL)
        {
            exit(0);
        }
        T -> da