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))
开始在想怎么找根节点,后来想想就20个点直接暴力算了,最长的就是根节点(没毛病)
递归处理一下 两个-1直接return ,不然就递归下去,返回是lef+自己+rig。
然后处理一下第一个不加(),之后的都加。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=110;
int l[N],r[N];
string s[N],ans="";
string work(int i,int f){
string lef,rig,fin;
if(l[i]==-1 && r[i]==-1) return s[i];
if(l[i]!=-1) lef = work(l[i],1);
if(r[i]!=-1) rig = work(r[i],1);
if(f) fin = '('+lef+s[i]+rig+')';
else fin = lef+s[i]+rig;
return fin;
}
int main(){
int n,m,t;
cin>>n;
for(int i=1;i<=n;i++){
cin>>s[i]>>l[i]>>r[i];
}
for(int i=1;i<=n;i++){
string tmp = work(i,0);
if(tmp.length() > ans.length())
ans = tmp;
}
cout<<ans<<endl;
}