题目

提交记录

#include<bits/stdc++.h>
using namespace std;
vector<int>a[3];
void dfs(int x)
{
	int l=a[x][0],r=a[x][1];
	cout<<char(x+'a'-1);
	if(l!=-1)dfs(l);
	if(r!=-1)dfs(r);
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
	   char k,x,y;
	   cin>>k>>x>>y;
	   if(x!='*')a[k-'a'+1].push_back(x-'a'+1);
	   else a[k-'a'+1].push_back(-1);
	   if(y!='*')a[k-'a'+1].push_back(y-'a'+1);
	   else a[k-'a'+1].push_back(-1);
	}
	/*for(int i=0;i<n;i++)
	{
	   for(int j=0;j<a[i].size();j++)cout<<a[i][j]<<" ";
	   cout<<"\n";
	}*/
	dfs(1);
	return 0;
}