SDUT- 3346 数据结构实验之二叉树七：叶子问题

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char a[105];
int p, len;
struct node
{
    char data;
    struct node *l, *r;
};
struct node *qu[10005];
int front = 0, tail = 0;
struct node *build()
{
    p++;
    if(p >= len)return NULL;
    struct node *h;
    if(a[p] == ','){h = NULL;}
    else
    {
        h = (struct node *)malloc(sizeof(struct node));
        h -> l = h -> r = NULL;
        h -> data = a[p];
        h -> l = build();
        h -> r = build();
    }
    return h;
};
int main()
{
    while(scanf("%s", a) != EOF)
    {
        getchar();
        p = -1;
        len = strlen(a);
        struct node *h = build();
        front = tail = 0;
        qu[tail++] = h;
        while(front < tail)
        {
            struct node *q = qu[front++];
            if(q != NULL)
            {
                if(q -> l == NULL && q -> r == NULL)printf("%c", q -> data);
                if(q -> l != NULL)qu[tail++] = q -> l;
                if(q -> r != NULL)qu[tail++] = q -> r;
            }
        }
        printf("\n");
    }
    return 0;
}