1130 Infix Expression 25

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)

#define base 2333
const int mod=1e9+7;
const int maxn=30+10;
const int ub=1e6;
int powmod(int x,int y){int t; for(t=1;y;y>>=1,x=x*x) if(y&1) t=t*x; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,l,r,rot;
string ch[maxn];
int L[maxn],R[maxn],vis[maxn];
void dfs(int u){
    if(u==-1) return ;
    if(u!=rot&&(L[u]!=-1||R[u]!=-1)) cout<<"(";
    dfs(L[u]);
    cout<<ch[u];
    dfs(R[u]);
    if(u!=rot&&(L[u]!=-1||R[u]!=-1)) cout<<")";
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    rep(i,1,n+1){
        cin>>ch[i];
        cin>>L[i]>>R[i];
        if(L[i]!=-1) vis[L[i]]=1;
        if(R[i]!=-1) vis[R[i]]=1;
    }
    rep(i,1,n+1) if(vis[i]==0) rot=i;
    dfs(rot);cout<<"\n";
    return 0;
}