[풀이]
#include<iostream>
#include<cstring>
using namespace std;
char arr[101] = { 0 };
void in_order(int n) {
if (arr[n] == 0)
return;
in_order(n * 2);
cout << arr[n];
in_order(n * 2 + 1);
}
int main() {
int n;
for (int t = 1; t <= 10; t++) {
for(int i = 0 ; i < 101 ; i++) arr[i] = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int node;
char v;
cin >> node >> v;
if (n % 2 == 0 && n / 2 > i || n % 2 == 1 && n / 2 >= i) {
scanf("%*d %*d");
}
else if (n % 2 == 0 && n / 2 == i) {
scanf("%*d");
}
arr[node] = v;
}
cout << "#" << t << ' ';
in_order(1);
cout << '\n';
}
}