PAT 甲级 1130. Infix Expression (25)
来源:互联网 发布:判断微信浏览器 js 编辑:程序博客网 时间:2024/06/07 19:13
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))
using namespace std;
struct node {
string val;
int left, right;
};
vector v;
int n, root = 1;
string dfs(int index) {
if (index == -1) return “”;
if (v[index].right != -1) {
v[index].val = dfs(v[index].left) + v[index].val + dfs(v[index].right);
if (index != root) v[index].val = ‘(’ + v[index].val + ‘)’;
}
return v[index].val;
}
int main() {
cin >> n;
v.resize(n + 1);
vector vis(n + 1, false);
for (int i = 1; i <= n; i++) {
cin >> v[i].val >> v[i].left >> v[i].right;
if (v[i].left != -1) vis[v[i].left] = true;
if (v[i].right != -1) vis[v[i].right] = true;
}
while (vis[root] == true) root++;
cout << dfs(root) << endl;
return 0;
}
- PAT 1130. Infix Expression (25)-甲级
- PAT甲级 1130. Infix Expression (25)
- PAT 甲级 1130. Infix Expression (25)
- PAT 1130. Infix Expression (25)
- PAT 1130. Infix Expression (25)
- 【PAT】【Advanced Level】1130. Infix Expression (25)
- PAT A1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- 1130. Infix Expression (25)
- PAT--1130. Infix Expression(中序加括号)
- PAT(A)-1130. Infix Expression (25)(树的中序遍历)
- PAT 1130. Infix Expression (25) 折腾表达式,未解之谜
- PAT 1130. Infix Expression (25) 前缀表达式、树的中序遍历
- Java 常用工具类 Collections 源码分析
- OpenShift Origin v3.7 端口转发
- PAT 甲级 1129. Recommendation System (25)
- ubuntu(16.04) 系统相互在root下免密ssh
- android的传参
- PAT 甲级 1130. Infix Expression (25)
- 工作总结
- CSDN-MARKDOWN flowchart.js 流程图详解
- Webpack中 publicPath 跟 path 的区别,个人理解
- CMake找不到opencv库解决办法
- 自动生成简单数学题的小程序范例
- Python练习题:类与对象
- 排序算法
- PAT 甲级 1131. Subway Map (30)