(204 Views)

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

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's see how to convert Prefix Notation to Postfix Notation.

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

- Reading from right to left, 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 cb+
- 'a' is then pushed into the stack.
- '*', is encountered and 'a' and string 'cb+' is popped and concatenated to give a string cb+a*
- Postfix form is obtained: cb+a*

You might be interested in this too.:

0 UpvotesUpvote |
0 DownvotesDownvote |

- Algorithm and Flowchart for Matrix addition [8706 Views]
- Frustrated Life of a Software Engineer [5079 Views]
- How to import data from a web service to database by SSIS package [1125 Views]
- Algorithm for Finding Factorial of a Number [9386 Views]
- Can FOREIGN KEY column contain null value or duplicate values [684 Views]

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