How to write a C++ program that uses stack operations to convert a given infix expression into its postfix equivalent, Implement the stack using an array.

Algorithm:

Step 1: Define a stack array.

Step 2: Scan each character in the infix string

Step 3: If it is between 0 to 9 or any alphabet, append it to postfix string.

Step 4: If it is left parenthesis push to stack If it is operator *,+,-,/,%,^ then If the stack is empty push it to the stack If the stack is not empty then start a loop: If the top of the stack has higher precedence Then pop and append to output string Else break Push to the stack If it is right parenthesis then While stack not empty and top not equal to left brace Pop from stack and append to output string Finally pop out the left brace.

Step 5: If there is any input in the stack pop and append to the Postfix string.

Output:

Enter the postfix experssion : a+b*c

Post fix expression is : abc*+

Enter the postfix experssion : a+(b+c*d)*f

Post fix expression is : abcd*+f*+

Enter the postfix experssion : a+(b*c+d)*f

Post fix expression is : abc*d+f*+