PAT（甲级） 2019秋季考试 7-3 Postifix Expression （25分）

7-3 Postfix Expression (25分)

状态：ACed

Given a syntax tree (binary), you are supposed to output the corresponding postfix 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.

Output Specification:
For each case, print in a line the postfix expression, with parentheses reflecting the precedences of the operators.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)%))+)

//有个坑，就是注意一元运算符除了-还有+
#include <iostream>
#include <stack>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 30;
int n;
struct node
{
    string data;
    int left = -1, right = -1;
} g[maxn];
bool H[maxn];
void show(int root) {
    if (root == -1) return;
    //如果碰到了一元运算符如正号、负号，此时不能直接后序遍历，应该前序遍历！！！
    if ((g[root].data == "-" || g[root].data == "+") && g[root].left == -1) {
        putchar('(');
        printf("%s", g[root].data.c_str());
        show(g[root].left);
        show(g[root].right);
        putchar(')');
    }
    else {
        putchar('(');
        show(g[root].left);
        show(g[root].right);
        printf("%s", g[root].data.c_str());
        putchar(')');
    }
}
int main() {
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> g[i].data >> g[i].left >> g[i].right;
        if (g[i].left != -1) H[g[i].left] = true;
        if (g[i].right != -1) H[g[i].right] = true;
    }
    int root = -1;
    for (int i = 1; i <= n; i++)
        if (!H[i]) { root = i;break; }
    if (root == -1) {
        printf("()");
    }
    else show(root);
    return 0;
}