1102 Invert a Binary Tree

#include<iostream> 
#include<vector>
#include<queue>
using namespace std;
const int MAXN=11;
struct Node{
	int left;
	int right;
}node[MAXN],invert[MAXN];
vector<int> le,in;
void level(int root){
	queue<int> q;
	q.push(root);
	while(!q.empty()){
		int now=q.front();
		q.pop();
		le.push_back(now);
		if(invert[now].left!=-1) q.push(invert[now].left);
		if(invert[now].right!=-1) q.push(invert[now].right);
	}
}
void intra(int root){
	if(root==-1) return;
	intra(invert[root].left);
	in.push_back(root);
	intra(invert[root].right);
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
	#endif
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		string l,r;
		cin>>l>>r;
		if(l!="-"){
			node[i].left=l[0]-'0';
			invert[i].right=l[0]-'0';	
		}else{
			node[i].left=-1;
			invert[i].right=-1;
		} 
		if(r!="-"){
			node[i].right=r[0]-'0';
			invert[i].left=r[0]-'0';
		}else{
			node[i].right=-1;
			invert[i].left=-1;
		} 
	}
	int flag[MAXN]={};
	for(int i=0;i<n;i++){
		if(node[i].left!=-1){
			flag[node[i].left]=1;
		}
		if(node[i].right!=-1){
			flag[node[i].right]=1;
		}
	}
	int root;
	for(int i=0;i<n;i++){
		if(flag[i]==0){
			root=i;break;	
		} 
	}
	level(root);
	intra(root);
	for(int i=0;i<n;i++){
		if(i==0) cout<<le[i];
		else cout<<' '<<le[i];
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		if(i==0) cout<<in[i];
		else cout<<' '<<in[i];
	}
	return 0;
}