树的层次遍历

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

#define MaxSize 50;
typedef char BiElemType;

typedef struct BiTNode{
BiElemType c;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode,*BiTree;

typedef struct tag{
BiTree p;
struct tag *pnext;
}tag_t,*ptag_t;

int main(){
BiTree pnew;
BiTree tree=NULL;
BiElemType c;
ptag_t phead=NULL,ptail=NULL,listpnew=NULL,pcur;
while(scanf(“%c”,&c))
{
if(c==‘\n’){
break;
}
pnew = (BiTree)calloc(1,sizeof (BiTNode));
pnew->c=c;
listpnew = (ptag_t) calloc(1,sizeof (tag_t));
listpnew->p=pnew;
if(NULLtree){
tree=pnew;
phead=listpnew;
ptail=listpnew;
pcur=listpnew;
}else{
ptail->pnext=listpnew;
ptail=listpnew;
if(pcur->p->lchildNULL){
pcur->p->lchild=pnew;
}else if(pcur->p->rchild==NULL){
pcur->p->rchild=pnew;
pcur=pcur->pnext;
}
}

}
return 0;

}