Infix expression: The expression of the form a op b. When an operator is in-between every pair of operands.
Postfix expression: The expression of the form a b op. When an operator is followed for every pair of operands.
Postfix notation, also known as reverse Polish notation, is a syntax for mathematical expressions in which the mathematical operator is always placed after the operands. Though postfix expressions are easily and efficiently evaluated by computers, they can be difficult for humans to read. Complex expressions using standard parenthesized infix notation are often more readable than the corresponding postfix expressions. Consequently, we would sometimes like to allow end users to work with infix notation and then convert it to postfix notation for computer processing. Sometimes, moreover, expressions are stored or generated in postfix, and we would like to convert them to infix for the purpose of reading and editing
Input : abc++ Output : (a + (b + c)) Input : ab*c+ Output : ((a*b)+c)
We have already discussed Infix to Postfix. Below is algorithm for Postfix to Infix.
1.While there are input symbol left
…1.1 Read the next symbol from the input.
2.If the symbol is an operand
…2.1 Push it onto the stack.
…3.1 the symbol is an operator.
…3.2 Pop the top 2 values from the stack.
…3.3 Put the operator, with the values as arguments and form a string.
…3.4 Push the resulted string back to stack.
4.If there is only one value in the stack
…4.1 That value in the stack is the desired infix string.
Below is the implementation of above approach:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Stack | Set 2 (Infix to Postfix)
- Infix to Postfix using different Precedence Values for In-Stack and Out-Stack
- Prefix to Infix Conversion
- Infix to Prefix conversion using two stacks
- Convert Infix To Prefix Notation
- Prefix to Postfix Conversion
- Postfix to Prefix Conversion
- Program to convert Infix notation to Expression Tree
- Stack | Set 4 (Evaluation of Postfix Expression)
- Lexicographically smallest string after M operations
- Count of prime factors of N to be added at each step to convert N to M
- Count of ways to split given string into two non-empty palindromes
- Minimum number of points required to cover all blocks of a 2-D grid
- First element of every K sets having consecutive elements with exactly K prime factors less than N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.