Postfix to Prefix notation Algorithm and Flowchart

[5855 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 Postfix Notation to Prefix Notation.

Flowchart for Postfix to Prefix Conversion

Flowchart for Postfix to Prefix Conversion
Remove WaterMark from Above Flowchart

Algorithm for Postfix to Prefix Conversion:

Step 1: Start Step 2: Read the Postfix expression from left to right. Step 3: If the scanned character is an operand, then push it onto the Stack. Step 4: If the scanned character is an operator, pop two operands from the stack and concatenate them in order of 'operator, operand2, operand1'. Push the result into the stack. Step 5: Repeat steps 2-4 until the postfix expression ends. Step 6: Pop all the rest elements of the stack if any. Step 7: Stop

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

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

You might be interested in this too.:

                 

Updated on 8 MARCH, 2021 by Shaddy


Want to Learn How to write own Algorithm and Flowcharts



Want to test your logical skills in Algorithms?



AI Powered Search Engine:



Comments










Search Anything:

Sponsored Deals ends in


E-Books & Study Notes:






Interesting Technical Quizzes:



Search Tags

    Algorithm for Postfix to Prefix notation

    Flowchart for Postfix to Prefix notation

You Might Also Like