Infixtopostfix code is not working

#1
#2

hi @kundankumarsports2, in the infix expression you can have brackets but in postfix expression we don’t have any brackets so the length is not same as that of infix for postfix expression , also there are some cases you are missing you can refer to below algo for that .
note: use stl stack for stack based questions , it will save your time
let me provide u the algo in

Algorithm

  1. Scan the infix expression from left to right.
  2. If the scanned character is an operand, output it.
  3. Else,
    ……3.1 If the precedence of the scanned operator is greater than the precedence of the operator in the stack(or the stack is empty or the stack contains a ‘(‘ ), push it.
    ……3.2 Else, Pop all the operators from the stack which are greater than or equal to in precedence than that of the scanned operator. After doing that Push the scanned operator to the stack. (If you encounter parenthesis while popping then stop there and push the scanned operator in the stack.)
  4. If the scanned character is an ‘(‘, push it to the stack.
  5. If the scanned character is an ‘)’, pop the stack and and output it until a ‘(‘ is encountered, and discard both the parenthesis.
  6. Repeat steps 2-6 until infix expression is scanned.
  7. Print the output
  8. Pop and output from the stack until it is not empty.

code : https://ide.codingblocks.com/s/216540

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.