Hello,

I need help in coding the following algorithm in c++ for converting an infix expression to a postfix

Converting an Infix Expression to a Postfix Expression: Example and Ideas So how we convert an infix expression to one in postfix form? Revisit the previous example: (7+2"3)4+31-26/2 Idea: 1 All operands will be copied to the output upon being read. Maintain a stack to store pending operators. 3. Each Operator in the input is pushed onto the stack when they're read, after all . Exception to 3: is always pushed onto the stack upon being read and won't be popped 5. When the end of the input is reached, all symbols still in the stack will be copied to operators in the stack with equal or higher priorities, if any, through the first "(" from the top or the bottom of the stack are popped out. out until a) is read from the input. the end of the output. Once an arithmetic expression is in postfix form, we no longer need to know the order of operations in order to evaluate the expression