1130. InfixExpression （25）

1130. Infix Expression (25)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue

Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflecting the precedences of the operators.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N ( <= 20 ) which is the total number of nodes in the syntax tree. Then N lines follow, each gives the information of a node (the i-th line corresponds to the i-th node) in the format:
data left_child right_child
where data is a string of no more than 10 characters, left_child and right_child are the indices of this node’s left and right children, respectively. The nodes are indexed from 1 to N. The NULL link is represented by -1. The figures 1 and 2 correspond to the samples 1 and 2, respectively.

Figure 1

Figure 2
Output Specification:
For each case, print in a line the infix expression, with parentheses reflecting the precedences of the operators. Note that there must be no extra parentheses for the final expression, as is shown by the samples. There must be no space between any symbols.
Sample Input 1:
8
* 8 7
a -1 -1
* 4 1
+ 2 5
b -1 -1
d -1 -1
- -1 6
c -1 -1
Sample Output 1:
(a+b)(c(-d))
Sample Input 2:
8
2.35 -1 -1
* 6 1
- -1 4
% 7 8
+ 2 3
a -1 -1
str -1 -1
871 -1 -1

Sample Output 2:

(a*2.35)+(-(str%871))

思路：直接中序遍历加括号即可，注意的是：
一：如果节点没有孩子，则不应该加括号
二：特别注意只有根节点的情况
三：加完括号去掉最外层括号即可

#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>

using namespace std;
const int MaxN = 26;
typedef struct tnode {
    string data;
    int lchild;
    int rchild;
}TNode;

TNode Tree[MaxN]; int n;
bool isRoot[MaxN]; int root;
string res;

void postOrder(int root)
{
    bool parentheses = Tree[root].lchild != -1 || Tree[root].rchild != -1;
    if (parentheses)res += "(";
    if (Tree[root].lchild != -1)postOrder(Tree[root].lchild);
    res += Tree[root].data;
    if (Tree[root].rchild != -1)postOrder(Tree[root].rchild);
    if (parentheses)res += ")";
}

int main() {
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    std::ios::sync_with_stdio(false);
    cin >> n; memset(isRoot, 1, n + 1);

    for (int i = 1; i <= n; ++i) {
        cin >> Tree[i].data >> Tree[i].lchild >> Tree[i].rchild;
        if (Tree[i].lchild != -1)isRoot[Tree[i].lchild] = false;
        if (Tree[i].rchild != -1)isRoot[Tree[i].rchild] = false;
    }

    for (int i = 1; i <= n; ++i) {
        if (isRoot[i]) {
            root = i;
            break;
        }
    }
    postOrder(root);
    if (res.size() >= 3) {
        res.erase(res.begin()); 
        res.erase(res.end() - 1);
    }
    cout << res;

    return 0;
}