(2242 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

0 UpvotesUpvote |
0 DownvotesDownvote |

- Algorithm to find whether a Number is Prime Number or Not [10782 Views]
- Create an Augmented Reality (AR) Android App using Unity and Artoolkit [6832 Views]
- C# program to Find GCD and LCM of Two Numbers [1074 Views]
- Simple Inheritance implementation in Python [1380 Views]
- How to compile and install OpenCV in Eclipse [1564 Views]

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

**Looking for any Software or Tutorial?**

Don't Worry, we will find it for you

Contact Now