Assume that all the other functions and classes are written. Just focus on the one part of code. Java Code. /** * A private helper conversion function that takes a list of tokens * (strings) in infix form and converts them to a list of tokens * (strings) in postfix form. * * For example: * tokens = ["A", "+", "B"] * postfix = ["A", "B", "+"] * * Note, this method must use either StackList or StackNode * to represent the stack structure in the conversion algorithm. * * @param tokens the list of tokens (strings) in infix form * @return a new queue of tokens (strings) in postfix form */

OUTPUT:

InToPost: converting expressions from infix to postfix... [A, +, B] [A, +, B, *, C] [A, +, B, *, C, +, D] [(, A, +, B, ), *, C] [(, A, +, B, ), /, (, C, -, D, )] [(, (, A, +, B, ), *, C, -, (, D, -, E, ), )] InToPost: emitting postfix expressions... A B + A B C * + A B C * + D + A B + C * A B + C D - / A B + C * D E - -

private Queue convert(List tokens) {}