PAT甲级1130
来源:互联网 发布:单片机datesheet是什么 编辑:程序博客网 时间:2024/05/22 00:28
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 7a -1 -1* 4 1+ 2 5b -1 -1d -1 -1- -1 6c -1 -1Sample Output 1:
(a+b)*(c*(-d))Sample Input 2:
82.35 -1 -1* 6 1- -1 4% 7 8+ 2 3a -1 -1str -1 -1871 -1 -1Sample Output 2:
(a*2.35)+(-(str%871))
#include<cstdio>#include<cstring>using namespace std;const int maxn = 30;bool hashtable[maxn] = { false };struct Node{char data[20];int leftchild, rightchild;Node():leftchild(-1),rightchild(-1){}}Nodes[maxn],node;int N;void inOrder(int root,int depth){if (root != -1){if(!(depth==0||Nodes[root].leftchild==-1&& Nodes[root].rightchild==-1))//零层及叶节点不加括号printf("(");inOrder(Nodes[root].leftchild,depth+1);printf("%s", Nodes[root].data);inOrder(Nodes[root].rightchild,depth+1);if (!(depth == 0 || Nodes[root].leftchild == -1 && Nodes[root].rightchild == -1))printf(")");}}int main(){scanf("%d", &N);for (int i = 1; i <= N; i++){scanf("%s%d%d", node.data, &node.leftchild, &node.rightchild);strcpy(Nodes[i].data, node.data);Nodes[i].leftchild = node.leftchild;Nodes[i].rightchild = node.rightchild;hashtable[node.leftchild] = true;hashtable[node.rightchild] = true;}int root = -1;for (int i = 1; i <= N; i++){if (hashtable[i] == false){root = i; break;//找根}}inOrder(root,0);return 0;}
- PAT甲级1130
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- PAT(甲级)1015
- PAT(甲级)1016
- 初学快速幂详细讲解
- 事件的三个阶段:捕获阶段 目标阶段 冒泡阶段
- C#之类私有成员的安全访问
- redux 配合 react 在项目中的使用(个人总结与备忘)
- Maven+springMVC+Spring框架
- PAT甲级1130
- AES128 ECB加密pkcs5padding补码
- poj 2250 Compromise 记录路径的lcs
- Numpy中的广播(Broadcasting)
- Java集合类TreeMap细节解析
- poj1185 炮兵阵地 状压dp
- 机器学习+深度学习+DL框架CNTK的文章列表
- Android App瘦身实战
- 解决AndroidStudio File类的Listfile返回值为null问题