(2772 Views)

Infix notation is a type of notation in which arithmetic expressions are normally written.

Postfix notation is a type of notation in which arithmetic expressions are written in a manner such that the operands appear before their operators. Postfix notation is a notation used in the system and is implemented using stacks. There is often a need to convert Infix to Postfix notation, so let's understand how the conversion is done.

Let's take an example to understand **a*(b+c)**,

- 'a' being an operand is scanned and printed.
- Then * is added to the stack. Again '(' is encountered and pushed in the stack.
- 'b' being an operand is scanned and printed.
- '+' being an operator is pushed into the stack.
- 'c' being an operand is scanned and printed.
- An ')' is encountered operator + is popped.
- Then, again top is popped and we print * and here, popping ends as the stack is empty.
- Stop

0 UpvotesUpvote |
0 DownvotesDownvote |

- Download AngularJS Up & Running by Shyam Seshadri & Brad Green PDF [2830 Views]
- How To Reset Autoincrement value of Column in MySQL [2430 Views]
- Content placeholder animation like Facebook Tutorial using Kotlin [1442 Views]
- Mumbai University Theoretical Computer Science (TCS) Semester 4 Important Notes Download [2466 Views]
- How to Debug Code in Unity3D [1192 Views]

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

**Looking for any Software or Tutorial?**

Don't Worry, we will find it for you

Contact Now