An arithmetic expression involving the binary operators addition(+), subtraction (-), multiplication (*), and division (/) can be represented by using a binary expression tree. In a binary expression tree, each operator has two children, which are either operands or subexpressions. Leaf nodes contain an operand; nonleaf nodes contain a binary operartor. The left and right subtrees of an operator describe a subexpression that is evaluated and used as one of the operands for the operator.
Write a program that inputs an infix expression and creates an expression tree. Output prefix expression and postfix expression, and display the tree.
Nice Bonus for complete program with comments THank you.