C Program to convert Infix to Postfix using Stack

Infix to Postfix Program in C.There is an algorithm to convert an infix expression into a postfix expression. It uses a stack; but in this case, the stack is used to hold operators rather than numbers. The purpose of the stack is to reverse the order of the operators in the expression. It also serves as a storage structure, since no operator can be printed until both of its operands have appeared.

In this algorithm, all operands are printed (or sent to output) when they are read. There are more complicated rules to handle operators and parentheses.

Example:

1. A * B + C becomes A B * C +

infix to postfix program in c

Conversion from Infix to Postfix in C program

OUTPUT of Infix to Postfix Conversion in C

You can learn about Stack using array in C here and for more quires go to quora