Description
The input is a postfix Boolean expression, which has at most four variables ‘A’, ’B’, ‘C’, and ‘D’, and two operators ‘&’ and ‘|’. The task is to use this postfix expression to construct a syntax tree, and print the corresponding infix expression. For example, if the input is
AB|CD&&A|
then its syntax tree should be
The corresponding infix expression with parenthesis is
A|B&(C&D)|A
You need to implement the function "constructTree()" based on the two files "main.c" and "function.h" given below.
For OJ submission:
You only need to copy and paste the code of your "function.c" into the submission block. Make sure you choose C compiler.
HINT :
Please read partial judge code first. We help you dealing with input ：）
Input
The first line is a number N indicating the number of test cases. The next N lines contain the prefix Boolean expressions.
Output
The output contains N lines of the infix expressions with necessary parentheses.