树的层次遍历UVa122

//#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;

char s[300];
bool failed;
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 remove_tree(Node* u)
{
	if(u == NULL) return ;
	remove_tree(u->left);
	remove_tree(u->right);
	delete 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=true;
	u->v = v;
	u->have_value = true;
}
bool read_input()
{
	failed = false;
	remove_tree(root);
	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;
}

int main()
{
	vector<int> ans;  
    while (read_input())
	{  
        if (!bfs(ans)) failed=1;  
        if (failed) printf("not complete\n");  
        else
		{  
            for (int i=0;i<ans.size();i++)
			{  
	            if (i!=0) printf(" ");  
	            printf("%d",ans[i]);  
            }  
            printf("\n");  
        }  
    }  
}
//(11,LL) (7,LLL) (8,R) (5,) (4,L) (13,RL) (2,LLR) (1,RRR) (4,RR) () (3,L) (4,R) ()