A1130 Infix Expression [中序遍历得中缀表达式]

#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<set>
#include<queue>
#include<unordered_set>
using namespace std;
int n, Root = 1;
int vis[21];
struct node
{
	string s;
	int l, r;
}Node[21];
void dfs(int root)
{
	if (root == -1) return;
	if (root != Root && (Node[root].l != -1 || Node[root].r != -1)) cout << "(";
	dfs(Node[root].l);
	cout << Node[root].s;
	dfs(Node[root].r);
	if (root != Root && (Node[root].l != -1 || Node[root].r != -1)) cout << ")";
}
int main()
{
	cin >> n;
	memset(vis, 0, sizeof(vis));
	for (int i = 1; i <= n; i++)
	{
		cin >> Node[i].s >> Node[i].l >> Node[i].r;
		if (Node[i].l != -1) vis[Node[i].l] = true;
		if (Node[i].r != -1) vis[Node[i].r] = true;
	}
	Root = 1;
	while (vis[Root] == 1) Root++;
	dfs(Root);
	return 0;
}