Stacks are used for converting infix expressions to postfix expressions. What is the postfix form of the infix expression "A + B * C"?

To convert the infix expression "A + B * C" to postfix, follow these steps:

1. Scan the infix expression from left to right.
2. If the scanned character is an operand, output it.
3. Else,
   • If the precedence of the scanned operator is greater than the precedence of the operator in the stack(or the stack is empty), push it.
   • Else, Pop the operator from the stack until the precedence of the scanned operator is less-equal to the precedence of the operator residing on the top of the stack. Push the scanned operator to the stack.
4. If the scanned infix expression is ended, output the remaining operators from the stack.

Now, let's apply these steps to the given infix expression "A + B * C":

1. Scan "A", it's an operand, so output it. Now, the output is "A".
2. Scan "+", it's an operator, and the stack is empty, so push it to the stack.
3. Scan "B", it's an operand, so output it. Now, the output is "A B".
4. Scan "", it's an operator, and its precedence is greater than the precedence of "+" which is on the top of the stack, so push "" to the stack.
5. Scan "C", it's an operand, so output it. Now, the output is "A B C".
6. The infix expression is ended, pop out the remaining operators from the stack and output them. The operators are "" and "+". Since "" has higher precedence, it comes out first, then "+". Now, the output is "A B C * +".

So, the postfix form of the infix expression "A + B * C" is "A B C * +".