In: Computer Science
For the following infix expression, build the corresponding expression tree.
1.1 a*b
1.2 a+b*c
1.3 a+b*c/d-e
Perform pre-order and post-order traversal of the above binary expression trees. What relationship exists among these scans and prefix and postfix notation for the expression?