Convert the following infix expressions to prefix and postfix form, and draw the expression tree for each. Assume the normal Java operators and precedence rules. Tip: For representing the expression tree as text, get creative! Use your best ASCII Art skills or other ways to represent the tree. 1. a) (a * b) + C
PREFIX:
POSTFIX:
EXPRESSION TREE:
2. b) a * b + c/d + 3
PREFIX:
POSTFIX:
EXPRESSION TREE:
3. c) a + 4* (e+d/2)
PREFIX:
POSTFIX:
EXPRESSION TREE: