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.
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))
解法:中序遍历,在非根节点和叶子节点的所有节点遍历时,在进入左子节点前打印左括号,在出右子节点时,打印出右括号。
另外就是如何找到根节点:因为节点的序号是由1到N,所以在输入时,就将子节点进行标记为1,name节点值为0的,就是根节点。
针对根节点使用中序遍历即可。
另外:输入重定向
streambuf *backup;
ifstream fin;
fin.open("data.in",1);
if (!fin)
{
cout << "fail to open the file" << endl;
return -1;//或者抛出异常。
}
else
{
backup = cin.rdbuf(); // back up cin's streambuf
cin.rdbuf(fin.rdbuf()); // assign file's streambuf to cin
}
cin.rdbuf(backup);//恢复输入的指向