1130 Infix Expression(25 分)
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))
中序遍历二叉树 把结果保存在一个 vector 里 然后去掉开头和结尾就可以了。
注意一个点是 只有根节点的时候 开头和结尾没有括号 所以 直接输出就可以了。
code
#pragma warning(disable:4996)
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class node {
public:
string val;
int left = -1, right = -1;
};
node varr[25];
void inorder(int pos);
int vis[25];
vector<string> vres;
int main() {
int n;
cin >> n;
string a;
int l, r;
for (int i = 1; i <= n; ++i) {
cin >> a >> l >> r;
varr[i].val = a; varr[i].left = l; varr[i].right = r;
vis[l] = 1; vis[r] = 1;
}
int root = -1;
for (int i = 1; i <= n; ++i) {
if (vis[i] == 0)root = i;
}
inorder(root);
if (vres.size() == 1) {
cout << vres[0];
}
for (int i = 1; i < vres.size() - 1; ++i) {
cout << vres[i];
}
system("pause");
return 0;
}
void inorder(int pos) {
if (pos == -1) return;
int f = 0;
if (varr[pos].left != -1 || varr[pos].right != -1) f = 1;
if(f) vres.push_back("(");
inorder(varr[pos].left);
vres.push_back(varr[pos].val);
inorder(varr[pos].right);
if(f) vres.push_back(")");
}