Your project is to extend hw#2 by creating an expression tree from the postfix expression derived in your Converter class. For this part of the assignment, the exact implementation is left up to you, though you must read input from the console (using Scanner or your own implementation) -- no more JOptionPane!

Use the algorithm described in recitation & presented on pages 109-112 of the text, as well as any of the data structures provided on the class webpages. After you create the tree, you should print the input expression as prefix, infix (with appropriate parenthesis), and postfix expressions. Your application should be able to handle multiple inputs before exiting (via Ctrl-C); i.e., after printing the results, it should ask for a subsequent infix expression on the console.