(1241 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.:

0 UpvotesUpvote |
0 DownvotesDownvote |

- Download DIGITAL SIGNAL PROCESSING by Ashok Ambardar PDF [1233 Views]
- Javascript Program to Check whether Number is Prime or Not [929 Views]
- Debug Javascript code in Android Mobile Browser [1647 Views]
- Difference between Join And Union in SQL [5949 Views]
- How to import data from a web service to database by SSIS package [889 Views]

- How To Win Ludo King Game Every Time [37586 Views]
- Algorithm to find whether number is Armstrong Number or Not [37508 Views]
- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [26970 Views]
- Jio Phone hang on LOGO problem Solution - Hard Reset Jio Phone [26430 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [19078 Views]