An arithmetic expression including the binary operators addition(+), subtraction (-), multiplication (*), and division (/) may be represented by utilizing a binary expression tree. In the binary expression tree, every operator has two children, which are either operands or the sub expressions. Leaf nodes consist of an operand; non leaf nodes consist of a binary operator. The left and right sub trees of an operator explain a sub expression that is evaluated and utilized as one of the operands for operator.

Write down a program that inputs an infix expression and generates an expression tree. Output prefix expression and postfix expression, and display the tree.