Aim : Implement a program to convert a given infix expression to postfix form using stacks. .

Theory

An infix expression is written with operators between operands (e.g., A + B). However, postfix notation places operators after operands (e.g., AB+), eliminating the need for parentheses.

🔹 Why Convert Infix to Postfix?

• Removes the need for parentheses.
• Maintains correct precedence using a stack.
• Can be easily evaluated using stacks.

📌 Algorithm

1. Scan the infix expression from left to right.
2. If the scanned character is an operand (A-Z, 0-9), add it to the output.
3. If the scanned character is an operator:
   • Pop operators from the stack if they have higher or equal precedence.
   • Push the current operator onto the stack.
4. If the scanned character is '(', push it onto the stack.
5. If the scanned character is ')', pop and output from the stack until '(' is found.
6. After scanning, pop all remaining operators from the stack.