Understanding infix to postfix conversion

Any expression written in the postfix notation can be easily parsed and evaluated by a computer as opposed to the infix notation. However, for us humans, writing postfix expressions is very difficult and error-prone as we are not used to it. However, we can convert an expression written in the infix notation to postfix using the infix to postfix conversion algorithm.

To keep things simple, consider the example of an infix notation without parentheses given below.