运用辅助队列实现树的层次遍历

#include "func.h"
void LevelOrder(BiTree T){
    LinkQueue Q;
    InitQueue(Q);
    EnQueue(Q,T);
    BiTree p;
    while(!IsEmpty(Q)){
        DeQueue(Q,p);
        putchar(p->c);
        if(p->lchild){
            EnQueue(Q,p->lchild);
        }if(p->rchild){
            EnQueue(Q,p->rchild);
        }
    }
}

int main() {
    BiTree pnew;
    BiTree tree=NULL;//空树
    char 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));
        //左右孩子不用指向Nullcalloc已做过
        listpnew->p=pnew;
        if(tree==NULL){
            tree=pnew;
            phead=listpnew;
            ptail=listpnew;
            pcur=listpnew;
        } else {
            ptail->pnext=listpnew;
            ptail=listpnew;
            if(NULL==pcur->p->lchild){
                pcur->p->lchild=pnew;
            }else if(pcur->p->rchild==NULL){
                pcur->p->rchild=pnew;
                pcur=pcur->pnext;
            }
        }
    }
    LevelOrder(tree);
    return 0;
}

func头文件

//
// Created by 11966 on 2024/2/13.
//

#ifndef BS_FUNC_H
#define BS_FUNC_H
#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;
//辅助队列的结构体
typedef BiTree ElemType;
typedef struct LinkNode{
    ElemType data;
    LinkNode *next;
}LinkNode;
typedef struct LinkQueue{
    LinkNode *f,*r;
}LinkQueue;
void InitQueue(LinkQueue &Q);
bool IsEmpty(LinkQueue Q);
bool EnQueue(LinkQueue &Q,ElemType num);
bool DeQueue(LinkQueue &Q,ElemType &num);
#endif //BS_FUNC_H

queue源文件

//
// Created by 11966 on 2024/2/13.
//
#include "func.h"
void InitQueue(LinkQueue &Q){
    Q.f=Q.r=(LinkNode*)malloc(sizeof (LinkNode));
    Q.f->next=NULL;//指向Null
}//初始化队列
bool IsEmpty(LinkQueue Q){
    if(Q.f==Q.r){
        return true;
    }
    return false;
}
bool EnQueue(LinkQueue &Q,ElemType num){
    LinkNode *p=(LinkNode*)malloc(sizeof (LinkNode));
    p->data=num;
    p->next=NULL;
    Q.r->next=p;
    Q.r=p;
}
bool DeQueue(LinkQueue &Q,ElemType &element){
    if(IsEmpty(Q)){
        return false;
    }
    LinkNode *p=Q.f->next;
    element=p->data;
    Q.f->next=p->next;
    if(Q.r==p){
        Q.r=Q.f;
    }
    free(p);
    return true;
}