1130. Infix Expression (25)-PAT甲级真题(中序遍历)

最新推荐文章于 2024-07-02 23:30:00 发布

~MakkaPakka~

最新推荐文章于 2024-07-02 23:30:00 发布

阅读量29

点赞数

文章标签：算法 pat考试 c++ 数据结构链表

本文链接：https://blog.csdn.net/hzj913313180/article/details/130607448

版权

题意

给定表达式的树，遍历一遍，得到中缀表达式，同时给中缀表达式加上括号。

思路

构造静态链表
存储、处理输入数据到rec
设置fr数组寻找根
构造中序遍历函数inorder
输出

题解

#include<bits/stdc++.h>
using namespace std;
struct node{
	string str;
	int l, r;
}rec[21];
int n, r, fr[21];
string inorder(int s){
	if(rec[s].l == rec[s].r) return rec[s].str;
	else if(s == -1) return "";
	else return "(" + inorder(rec[s].l) + rec[s].str + inorder(rec[s].r) + ")";
}
int main(){
	cin>>n;
	for(int i = 1; i <= n; i ++){
		cin>>rec[i].str>>rec[i].l>>rec[i].r;
		if(rec[i].l != -1) fr[rec[i].l] = 1;
		if(rec[i].r != -1) fr[rec[i].r] = 1;
	}
	for(int i = 1; i <= n; i ++)
		if(fr[i] == 0) r = i;
	string ans = inorder(r);
	if(rec[r].l == rec[r].r) cout<<rec[r].str;
	else cout<<ans.substr(1, ans.size() - 2);
	return 0;
}

题目

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))