[SDUTOJ][3710]——二叉树——D - 数据结构实验之二叉树五：层序遍历

#include <bits/stdc++.h>
#define TElemType char
using namespace std;
const int maxn = 55;

typedef struct BiTNode{
    TElemType data;
    struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;

char pre[maxn];
int p;
void levelOrderTraverse(BiTree root){
    if(root == NULL)
        return ;
    queue<BiTree>q;
    q.push(root);

    BiTree tmp;
    while(!q.empty()){
        tmp = q.front();
        q.pop();

        printf("%c", tmp->data);
        if(tmp->lchild!=NULL)
            q.push(tmp->lchild);
        if(tmp->rchild!=NULL)
            q.push(tmp->rchild);
        free(tmp);
    }
}

BiTree build(){
    if(pre[p] == ','){
        p++;
        return NULL;
    }

    BiTree root = (BiTree)malloc(sizeof(BiTNode));
    root->data = pre[p++];
    root->lchild = build();
    root->rchild = build();

    return root;
}

int main(){

    int t;
    scanf("%d", &t);

    while(t--){
        scanf("%s", pre);
        p = 0;
        BiTree root = build();

        levelOrderTraverse(root);
        printf("\n");

    }

    return 0;
}