层次遍历

问题描述：

输入一棵二叉树，你的任务是按从上到下、从左到右的顺序输入各个结点的值。每个结点都按照从根结点到它的移动序列给出（L表示左，R表示右）。再输入中，每个结点的左括号和右括号之间没有空格，相邻结点之间用一个空格隔开。每棵树的输入用一对空括号（）结束。

样例输入：

(11，LL) (7，LLL)  (8,R) (5,) (4,L) (13，RL) (2，LLR) (1，RRR) (4,RR) ()

(3,L) (4,R) ()

样例输出：

5 4 8 11 13 4 7 2 1

-1

#include<cstdio>
#include<cstdlib>
#include<cstring>
#define MAXN 1000

typedef struct TNode
{
    int have_value;
    int v;
    struct TNode *left, *right;
} Node;

Node* root;
int failed = 0;
Node* newnode()
{
    Node* u = (Node*) malloc(sizeof(Node));
    if(u != NULL)
    {
        u->have_value = 0;
        u->left = u->right = NULL;
    }
    return u;
}
void remove_tree(Node* u)
{
    if(u == NULL) return;
    remove_tree(u->left);
    remove_tree(u->right);
    free(u);
}
void addnode(int v,char* s)
{
    int n = strlen(s);
    Node* u = root;
    for(int i = 0; i < n; i++)
        if(s[i] == 'L')
        {
            if(u->left == NULL) u->left = newnode();
            u = u->left;
        }else if(s[i] == 'R')
        {
            if(u->right == NULL) u->right = newnode();
            u = u->right;
        }
        if(u->have_value) failed = 1;
        u->v = v;
        u->have_value = 1;
}

char s[MAXN+10];
int read_input()
{
    failed = 0;
    remove_tree(root);
    root = newnode();
    for(;;)
    {
        if(scanf("%s",s) != 1) return 0;
        if(!strcmp(s,"()")) break;
        int v;
        sscanf(&s[1],"%d",&v);
        addnode(v,strchr(s,',')+1);
    }
    return 1;
}

int n = 0, ans[MAXN];
int bfs()
{
    int front = 0, rear = 1;
    Node* q[MAXN];
    q[0] = root;
    while(front < rear)
    {
        Node* u = q[front++];
        if(!u->have_value) return 0;
        ans[n++] = u->v;
        if(u->left != NULL) q[rear++] = u->left;
        if(u->right != NULL) q[rear++] = u->right;
    }
    return 1;
}


int main()
{
//    freopen("D:\\1.txt","r",stdin);
    read_input();
    bfs();
    if(n == 0)
        printf("-1\n");
    else
    {

    for(int i = 0; i < n; i++)
        printf("%d ",ans[i]);
    printf("\n");
    }
    return 0;
}