我的层次遍历二叉树错在哪
#include<stdio.h>
#include<stdlib.h>
struct node                                    //树结构体
{
    char data;
    struct node *lchild,*rchild;
};                        
struct line                                    //队结构体
{
    struct node*ch;
    struct line *next;
};                  
struct link                                         //队首，队尾
{
    struct line *front;
    struct line *rear;
   
};                           


void createbitree(struct node*T)                     //建树     
{
    char ch;
    scanf("%c",&ch);
    if(ch==' ')
        T=NULL;
    else
    {
        if(!(T=(struct node*)malloc(sizeof(struct node))))
            exit(0);
        T->data=ch;
        createbitree(T->lchild);
        createbitree(T->rchild);
    }
   
}

   
void initqueue( struct link*q)                              //初始化队  
{
    q->front=q->rear=(struct line*)malloc(sizeof(struct line));
    if(!q->front)
        exit(0);
    q->front->next=NULL;

   
   
}


void enqueue( struct link*q, struct node*e)                      //入队
{
    struct line*p;
    p=(struct line*)malloc(sizeof(struct line));
    p->ch=e;
    p->next=NULL;
    q->rear->next=p;
    q->rear=p;
}
void dequeue(struct link*q,struct node*e)                         //出队
{
   
    char data;
    struct line*p;
    p=q->front->next;
    e=p->ch;
data=e->data;
    q->front->next=p->next;
    if(q->rear==p)
        q->rear=q->front;
    free(q);
    printf("%c ",data);
}


int queueempty(struct link q)                           //判断队是否为空
{
    if(q.front->next==NULL)
        return 1;
    else return 0;
}


void main()
{
struct link*q;
struct node*p;
truct node*T;
createbitree(T);
initqueue(q);
p=T;
enqueue(q,p);
while(queueempty(*q)!=1)
{
dequeue(q,p);
if(p->lchild!=NULL)
enqueue(q,p->lchild);
if(p->rchild!=NULL)
enqueue(q,p->rchild);
}
printf("\n");

printf("按层次遍历树中结点其输出顺序为: \n");

}
语法上已经没问题，但不知算法上有什么错，请高手帮看一下

#include<stdio.h>
#include<stdlib.h>

struct node//树结构体
{
    char data;
    struct node *lchild,*rchild;
};  
                 
struct line //队结构体
{
    struct node*ch;
    struct line *next;
};   
              
struct link  //队首，队尾
{
    struct line *front;
    struct line *rear;
};                           


node* createbitree(struct node*T)//建树     
{/*先序建立二叉树*/
    char ch;
    scanf("%c",&ch);
    getchar();
    if(ch==' ')
        T=NULL;
    else
    {
        if(!(T=(struct node*)malloc(sizeof(struct node))))
            exit(0);
        T->data=ch;
        T->lchild = createbitree(T->lchild);
        T->rchild = createbitree(T->rchild);
    }
    return T;
}

  
struct link* initqueue( struct link*q)                              //初始化队  
{
    q = (struct link*)malloc(sizeof(struct link));
    if(!q)
        exit(0);
    q->rear = q->front = NULL;
    return q;
}

void enqueue( struct link*q, struct node*e)                      //入队
{
    struct line*p;
    p=(struct line*)malloc(sizeof(struct line));
    p->ch=e;
    p->next=NULL;
    if( q->front == 0 )
    {
        q->rear = q->front = p;
    }
    else
    {
        q->rear->next = p;
        q->rear = p;
    }
}

struct node* dequeue(struct link*q)                         //出队
{
    struct node*e;
    struct line*p;
    p = q->front;
    e = p->ch;
    q->front = p->next;
    printf(" %c", e->data);
    return e;
}


int queueempty(struct link q)                           //判断队是否为空
{
    if(q.front == NULL)
        return 1;
    else return 0;
}

void show_tree(struct node*T)
{
    if(T)
    {
        printf(" %c", T->data);
        show_tree(T->lchild);
        show_tree(T->rchild);
    }
}
void main()
{
    struct link*q = 0;/*定义队列指针*/
    struct node*p ;//= (struct node*)malloc(sizeof(struct node));
    struct node*T = 0;
    T = createbitree(T);
    show_tree(T);
    printf("\n");
    q = initqueue(q);
   
    printf("按层次遍历树中结点其输出顺序为: \n");
    enqueue(q,T);
    while(!queueempty(*q))
    {
        p = dequeue(q);
        if(p->lchild!=NULL)
            enqueue(q,p->lchild);
        if(p->rchild!=NULL)
            enqueue(q,p->rchild);
    }
    printf("\n");
}

很感谢你的解答，等这么久第一个解答的人，好感动！！！
但是好像还是没对，这下连建树函数都执行不准确了。
请在帮我看一下，顺便问几个问题：
#include<stdio.h>
#include<stdlib.h>

struct node//树结构体
{
    char data;
    struct node *lchild,*rchild;
};  
                 
struct line //队结构体
{
    struct node*ch;
    struct line *next;
};   
              
struct link  //队首，队尾
{
    struct line *front;
    struct line *rear;
};                           


node* createbitree(struct node*T)//建树     
{/*先序建立二叉树*/
    char ch;
    scanf("%c",&ch);
    getchar();
    if(ch==' ')
        T=NULL;
    else
    {
        if(!(T=(struct node*)malloc(sizeof(struct node))))
            exit(0);
        T->data=ch;
        T->lchild = createbitree(T->lchild);
        T->rchild = createbitree(T->rchild);
    }
    return T;
}

  
struct link* initqueue( struct link*q)                              //初始化队  
{
    q = (struct link*)malloc(sizeof(struct link));
    if(!q)
        exit(0);
    q->rear = q->front = NULL;
    return q;
}

void enqueue( struct link*q, struct node*e)                      //入队
{
    struct line*p;
    p=(struct line*)malloc(sizeof(struct line));
    p->ch=e;
    p->next=NULL;
    if( q->front == 0 )
    {
        q->rear = q->front = p;
    }
    else
    {
        q->rear->next = p;
        q->rear = p;
    }
}

struct node* dequeue(struct link*q)                         //出队
{
    struct node*e;
    struct line*p;
    p = q->front;
    e = p->ch;
    q->front = p->next;
    printf(" %c", e->data);
    return e;
}


int queueempty(struct link q)                           //判断队是否为空
{
    if(q.front == NULL)
        return 1;
    else return 0;
}

void show_tree(struct node*T)
{
    if(T)
    {
        printf(" %c", T->data);
        show_tree(T->lchild);
        show_tree(T->rchild);
    }
}
void main()
{
    struct link*q = 0;/*定义队列指针*/   这里等于0是干什么？可以这样表达吗
    struct node*p ;//= (struct node*)malloc(sizeof(struct node));
    struct node*T = 0;还有这里
    T = createbitree(T);
    show_tree(T);
    printf("\n");
    q = initqueue(q);
   
    printf("按层次遍历树中结点其输出顺序为: \n");
    enqueue(q,T);
    while(!queueempty(*q))
    {
        p = dequeue(q);
        if(p->lchild!=NULL)
            enqueue(q,p->lchild);
        if(p->rchild!=NULL)
            enqueue(q,p->rchild);
    }
    printf("\n");
}

刚才的问题，好像和输入有关系

本来是不想截图的

路过看看

为什么我的运行也是没结果的啊？？
  难道是编译器的问题