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))
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
解法:先构建树,找到根节点,再遍历树就可以了
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int n;
struct node{
int val,parent=-1;
string str;
int left=-1,right=-1;
};
vector<node> v;
void inOrder(int root){
if(root == -1) return;
//除了这俩情况加括号别的都不加括号
bool flag = v[root].parent == -1 ||(v[root].left == -1 && v[root].right == -1) ? false : true;
if(flag) cout<<"(";
inOrder(v[root].left);
cout<<v[root].str;
inOrder(v[root].right);
if(flag) cout<<")";
}
int main(){
cin>>n;
v.resize(n+1);
for(int i=1;i<=n;i++){
string val;
int left,right;
cin>>val>>left>>right;
v[i].str = val;
v[i].val = i;
v[i].left = left;
v[left].parent = i;
v[i].right = right;
v[right].parent = i;
}
node one = v[1];
while(one.parent!=-1) one=v[one.parent];
inOrder(one.val);
}