第C語言二叉樹層序遍歷實(shí)現(xiàn)下面圖中的二叉樹層序遍歷

#includestdio.h

#includestdlib.h

#includestdbool.h

#includeunistd.h

typedefstructnode{

chardata;

structnode*lchild;

structnode*rchild;

}NODE,*PNODE;

typedefstructqnode{

PNODEpnode;

structqnode*next;

}QNODE,*PQNODE;

typedefstructqueue{

PQNODEfront;

PQNODErear;

intsize;

}QUEUE,*PQUEUE;

PNODECreateTree(void);

voidinitQueue(PQUEUE);

voidenQueue(PQUEUE,PNODE);

booldeQueue(PQUEUE,PNODE*);

voidlevelTraversal(PNODE);

PNODECreateTree(void)

PNODEpA=(PNODE)malloc(sizeof(NODE));

PNODEpB=(PNODE)malloc(sizeof(NODE));

PNODEpC=(PNODE)malloc(sizeof(NODE));

PNODEpD=(PNODE)malloc(sizeof(NODE));

PNODEpE=(PNODE)malloc(sizeof(NODE));

PNODEpF=(PNODE)malloc(sizeof(NODE));

PNODEpG=(PNODE)malloc(sizeof(NODE));

pA-data='A';

pB-data='B';

pC-data='C';

pD-data='D';

pE-data='E';

pA-lchild=pB;

pA-rchild=pC;

pB-lchild=pB-rchild=NULL;

pC-lchild=pD;

pC-rchild=NULL;

pD-lchild=NULL;

pD-rchild=pE;

pE-lchild=pE-rchild=NULL;

returnpA;

voidinitQueue(PQUEUEpQ){

pQ-front=pQ-rear=(PQNODE)malloc(sizeof(QNODE));

if(!pQ-front){

printf("initmallocerror!\n");

exit(-1);

pQ-front-next=NULL;

pQ-size=0;

voidenQueue(PQUEUEpQ,PNODEpnode){

//printf("en_queue%c",pnode-data);

PQNODEpNew;

pNew=(PQNODE)malloc(sizeof(QNODE));

if(!pNew){

printf("en_queuemallocerror!\n");

exit(-1);

pNew-pnode=pnode;

pNew-next=NULL;

pQ-rear-next=pNew;

pQ-rear=pNew;

pQ-size++;

//printf("success.\n");

booldeQueue(PQUEUEpQ,PNODE*ppnode){

//printf("de_queue...");

PQNODEtmp;

if(pQ-front-next==NULL){

printf("failed,queueempty!\n");

returnfalse;

tmp=pQ-front-next;

*ppnode=tmp-pnode;

pQ-front-next=tmp-next;

//最后一個(gè)節(jié)點(diǎn)出隊(duì)特殊處理

if(tmp-next==NULL)

pQ-rear=pQ-front;

free(tmp);

pQ-size--;

//printf("success,value:%c\n",(*ppnode)-data);

returntrue;

voidlevelTraversal(PNODEpnode){

if(pnode){

QUEUEQ;

PNODEtmp;

initQueue(

enQueue(Q,pnode);

intlevelSize,level;

level=0;

while(Q.size){

sleep(1);

level++;

levelSize=Q.size;

printf("traversallevel%dhave%dnodes:",level,levelSize);

for(inti=0;ilevelSize;i++){

deQueue(Q,tmp);

printf("%c,