Scribd
Upload
61 views1 page

Postfix To Prefix Expression

The document describes how to convert a postfix expression to a prefix expression in 3 steps: 1) Read the postfix expression from left to right and push operands onto a stack 2) When an operator is encountered, pop two operands from the stack, concatenate them with the operator to create a string, and push this string back onto the stack 3) Repeat until the end, then the final string remaining on the stack is the prefix form

Uploaded by

Aanchal Bawa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
61 views1 page

Postfix To Prefix Expression

The document describes how to convert a postfix expression to a prefix expression in 3 steps: 1) Read the postfix expression from left to right and push operands onto a stack 2) When an operator is encountered, pop two operands from the stack, concatenate them with the operator to create a string, and push this string back onto the stack 3) Repeat until the end, then the final string remaining on the stack is the prefix form

Uploaded by

Aanchal Bawa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Postfix to Prefix Conversion

Postfix: An expression is called the postfix expression if the operator appears in the
expression after the operands. Simply of the form (operand1 operand2 operator).
Example : AB+CD-* (Infix : (A+B) * (C-D) )
Prefix : An expression is called the prefix expression if the operator appears in the
expression before the operands. Simply of the form (operator operand1 operand2).
Example : *+AB-CD (Infix : (A+B) * (C-D) )
Given a Postfix expression, convert it into a Prefix expression.
Conversion of Postfix expression directly to Prefix without going through the process of
converting them first to Infix and then to Prefix is much better in terms of computation
and better understanding the expression (Computers evaluate using Postfix
expression).

Examples:
Input : Postfix : AB+CD-*
Output : Prefix : *+AB-CD
Explanation : Postfix to Infix : (A+B) * (C-D)
Infix to Prefix : *+AB-CD

Input : Postfix : ABC/-AK/L-*


Output : Prefix : *-A/BC-/AKL
Explanation : Postfix to Infix : ((A-(B/C))*((A/K)-L))
Infix to Prefix : *-A/BC-/AKL
Algorithm for Postfix to Prefix:
 Read the Postfix expression from left to right
 If the symbol is an operand, then push it onto the Stack
 If the symbol is an operator, then pop two operands from the Stack
Create a string by concatenating the two operands and the operator before them.
string = operator + operand2 + operand1
And push the resultant string back to Stack
 Repeat the above steps until end of Prefix expression.

You might also like