#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 25;
int n;
string v[N];
int l[N], r[N];
bool st[N];
void dfs(int u)
{
cout << '(';
if (l[u] != -1 && r[u] != -1)
{
dfs(l[u]);
dfs(r[u]);
cout << v[u];
}
else if (l[u] == -1 && r[u] == -1)
{
cout << v[u];
}
else
{
cout << v[u];
dfs(r[u]);
}
cout << ')';
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++ )
{
cin >> v[i] >> l[i] >> r[i];
if (l[i] != -1) st[l[i]] = true;
if (r[i] != -1) st[r[i]] = true;
}
int root;
for (int i = 1; i <= n; i ++ )
if (!st[i])
root = i;
dfs(root);
return 0;
}
AcWing 4274. 后缀表达式
最新推荐文章于 2024-07-09 22:37:42 发布