PAT 1102

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

const int maxn=40;
stack<int> s;
vector<int> le;
vector<int> in;
bool hashtable[11]={false};
//int pre[maxn],in[maxn];
//int preL,preR,inL,inR;

struct node
{
	node* lchild;
	node* rchild;
	int data;
};

void level_traverse(node* root)
{
	queue<node*> q;
	q.push(root);
	while(!q.empty())
	{
		node* top=q.front();
		q.pop();
		le.push_back(top->data);
		if(top->rchild!=NULL)
			q.push(top->rchild);
		if(top->lchild!=NULL)
			q.push(top->lchild);
	}
}

void inorder(node* root)
{
	if(root==NULL)
		return;
	inorder(root->rchild);
	in.push_back(root->data);
	inorder(root->lchild);
}
node* rotemp[10];
int main()
{
	for(int i=0;i<10;i++)
	{
		rotemp[i]=new node;//init
		rotemp[i]->lchild=NULL;
		rotemp[i]->rchild=NULL;
	}
	int n;
	scanf("%d",&n);
	char c;
	for(int i=0;i<n;i++)
	{
		rotemp[i]->data=i;
		scanf("%*c%c ",&c);
		if(c=='-')
			rotemp[i]->lchild=NULL;
		else
		{
			rotemp[i]->lchild=rotemp[c-'0'];
			hashtable[c-'0']=true;
		}

		scanf("%c",&c);
		if(c=='-')
			rotemp[i]->rchild=NULL;
		else
		{
			rotemp[i]->rchild=rotemp[c-'0'];
			hashtable[c-'0']=true;	
		}
	}
	node* root;
	for(int i=0;i<n;i++)
	{
		if(hashtable[i]==false)
				root=rotemp[i];
	}
	inorder(root);
	level_traverse(root);
	for(int i=0;i<(le.size()-1);i++)
	{
		printf("%d ",le[i]);
	}
	printf("%d\n",le[le.size()-1]);

	for(int i=0;i<(in.size()-1);i++)
	{
		printf("%d ",in[i]);
	}
	printf("%d\n",in[in.size()-1]);
	system("pause");
	return 0;
}