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.
|
|
|
|
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 -1Sample 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 -1Sample Output 2:
(a*2.35)+(-(str%871))
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
#define NULL -1
#define N 25
struct node{
string str;//数据
int left;//左孩子
int right;
}a[N];
int n;
bool book[N];
int Root;//建树
int build(){
scanf("%d",&n);
memset(book,false,sizeof(book));
int l,r;
for(int i = 1;i <= n;i++){
cin>>a[i].str;
scanf("%d%d",&l,&r);< //判断是否为空
if(l==-1){
a[i].left = NULL;
}else{
a[i].left = l;
book[l] = true;//标记
}
if(r==-1){
a[i].right = NULL;
}else{
a[i].right = r;
book[r] = true;
}
}
for(int i = 1;i <= n;i++){
if(book[i] == false){//没有标记的就是根节点
Root = i;
}
}
return Root;
}
void print(int root){
if(root == NULL){ //跟为空直接返回
return ;
}
if((root == Root)||(a[root].left==NULL&&a[root].right==NULL)){//左右子树不存在或者为根节点则不需要输出括号
print(a[root].left);//输出左子树
cout<<a[root].str;//输出结点数据
print(a[root].right);//输出右子树
}else{
printf("(");
if(a[root].left != NULL)
print(a[root].left);
cout<<a[root].str;
if(a[root].right != NULL)
print(a[root].right);
printf(")");
}
}
int main(){
// freopen("input.txt","r",stdin);
int root = build();
print(root);
return 0;
}