[19203 views]

Infix notation is a type of notation in which arithmetic expressions are written in a manner such that the operators appear in between the operands.

Postfix notation is a type of notation in which arithmetic expressions are written in a manner such that the operands appear before their operators.

Let' see how to convert Postfix expression to Infix expression:

Let's take an example to understand **cb+a***

- Reading from left to right, we scan the operands 'c' 'b' respectively and push it into the the stack.
- '+' is scanned and operands 'c', 'b' are popped and concatenated in form of c+b
- 'a' is then pushed into the stack.
- '*', is encountered and 'a' and string 'c+b' is popped and concatenated to give a string (c+b)*a
- Postfix form is obtained: (c+b)*a

You might be interested in this too.:

- Algorithm and Flowchart to find if a Number is Even or Odd
- Algorithm and Flowchart to find whether a number is Prime Number or Not
- Algorithm and Flowchart for Armstrong Number
- Algorithm for Finding Factorial of a Number
- Algorithm and Flowchart to Calculate Fibonacci series up to n
- How to round a number to nearest integer using python
- Can we have DB table without a primary key?
- Why does everyone hate Java?
- How much JavaScript to learn for Web Development
- How to store password like sensitive information in application