Question
- write down a java program, which build a binary tree, given an arithmetic expression.
- The arithmetic expression is: ((a * ((b + c)/ (d - e))) -f)
- The arithmetic expression contains variables and arithmetic operators,
- The operators take exactly two operands or arguments.
- Parentheses are allowed, except that inside a pair of parentheses only one operator is allowed. For case, (a+b) is ok, but (a+ b+ c) is not.
- The binary tree has to be proper tree and implementation has to be based on array.
- Traverse this binary tree in inorder and postorder.
- The node "visitation "have to be an output of the node name.