Introduction - If you have any usage issues, please Google them yourself
Problem Description infix expression is what we usually write mathematical expressions, the suffix expressions are also called Reverse Polish Notation in compiler writing program for our expression syntax checking, often it can be reverse Polish expression. We want to design and implement programs that will infix arithmetic expression into a suffix, for example, the infix expression (A a (B* C ten D)* E)/(F ten G) is converted to the suffix expressed as: ABC* D ten E*-FG ten/Note: To simplify programming, assuming the variable names are a single letter, operators only+,-,*, /, and ^ (exponentiation), can handle parentheses ( ), and assumes that the input of the arithmetic expression is correct. Requirements: Using the stack data structure, the input infix expression input integer ending with# N. Here there are N represents infix expression of N by a single letter and operators constitute an expression output N suffix expressions.