uva 122 - Trees on the level（一棵瞧着书都写不利索的树…）

uva 122 - Trees on the level（一棵看着书都写不利索的树……）

#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

const int maxn = 1000;
char s[maxn];
bool failed;
vector<int > ans;
struct node
{
    bool have_value;
    int v;
    node *left,*right;
    node():have_value(false),left(NULL),right(NULL) {}
};
node* root;
node* newnode()
{
    return new node();
}

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 = true;
    }
    u->v=v;
    u->have_value=true;
}

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

bool bfs(vector<int>& ans)
{
    queue<node*> q;
    ans.clear();
    q.push(root);
    while(!q.empty())
    {
        node* u=q.front();
        q.pop();
        if(!u->have_value) return false;
        ans.push_back(u->v);
        if(u->left!=NULL) q.push(u->left);
        if(u->right!=NULL) q.push(u->right);
    }
    return true;
}

void pri_out()
{
    int t=0;
    for(int i=0; i<ans.size(); i++)
    {
        if(i) printf(" ");
        printf("%d",ans[i]);
    }
    printf("\n");
    ans.clear();
}

int main()
{
    while(read_input())
    {
        bfs(ans);
        if(failed||!bfs(ans)) printf("not complete\n");
        else pri_out();
    }
    return 0;
}

啥也不说了 看见AC了就高兴了...