1130 Infix Expression - (25分)

最新推荐文章于 2020-09-14 23:57:40 发布

原创

最新推荐文章于 2020-09-14 23:57:40 发布 · 396 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#二叉树

根据给定的二叉树结构，输出相应的中缀表达式，考虑运算符优先级，正确使用括号。

题目

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)N(\le20)$ 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$