Convert Prefix to Postfix Expression

Objective: Given a Prefix expression, write an algorithm to convert it into Postfix expression.

Example:

Input: Prefix expression:  + A B 
Output: Postfix expression: A B +

Input: Prefix expression:  *-A/BC-/AKL
Output: Postfix expression: ABC/-AK/L-*

Approach: Use Stacks

Algorithm:

Iterate the given expression from left to right, one character at a time

  1. If the character is operand, push it to the stack.
  2. If the character is operator,
    1. Pop an operand from the stack, say it’s s1.
    2. Pop an operand from the stack, say it’s s2.
    3. perform (s1 s2 operator) and push it to stack.
  3. Once the expression iteration is completed, initialize the result string and pop out from the stack and add it to the result.
  4. Return the result.

Please walk through the example below for more understanding.

Java Code:

Output:

Prefix Expression: *-A/BC-/AKL
Postfix Expression: ABC/-AK/L-*

__________________________________________________
Top Companies Interview Questions..-

Google Microsoft Amazon Facebook more..

If you find anything incorrect or you feel that there is any better approach to solve the above problem, please write comment.
__________________________________________________

You may also like...

%d bloggers like this: