P1305 新二叉树

#include<bits/stdc++.h>
using namespace std;
const int N=28;
char a[N],b[N];
void pl(char root){
	if(root=='*'){
		return;
	}
	cout<<root;
	int index=root-'a'+1;
	pl(a[index]);
	pl(b[index]);
}
int main(){
	ios::sync_with_stdio(false);
	int n;
	cin>>n;
	string s;
	cin>>s;
	char root=s[0];
	int index=root-'a'+1;
	a[index]=s[1];
	b[index]=s[2];
	for(int i=2;i<=n;i++){
		cin>>s;
		int t=s[0]-'a'+1;
		a[t]=s[1];
		b[t]=s[2];
	}
	pl(root);
	return 0;
}