Programming Language: Java

Practical 7 Binary Trees 1. Write a program that takes a postfix expression and produces a binary expression tree. You can assume that the postfix expression is a string that has only binary operators and one-letter operands. After building the expression tree, your program should display the postfix form of the expression. Hint: Use a stack of binary subtrees to store the subexpressions. You may use the following statement to declare and create the stack object: Stack> stack = new >()