[13701 views]

Infix notation is a type of notation in which arithmetic expressions are written in a manner such that the operators appear in between the operands.

Prefix notation is a type of notation in which arithmetic expressions are written in a manner such that the operands appear after operators. Let's see how to convert Prefix to Infix.

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 b+c
- 'a' is then pushed into the stack.
- '*', is encountered and 'a' and string 'b+c' is popped and concatenated to give a string a*(b+c)
- Postfix form is obtained: a*(b+c)

You might be interested in this too.:

- Java IDE Online
- Python IDE Online
- JSON Formatter/Minifier Online
- Case Converter
- Reverse String
- HTML Encoder
- HTML Decoder
- URL Encoder
- URL Decoder
- Decimal To Binary
- Binary To Decimal
- Decimal To Octal
- Binary To Octal
- Decimal To Hexadecimal
- Hexadecimal To Decimal
- Hexadecimal To Binary
- Octal To Decimal
- Octal to Hexadecimal
- Octal to Binary
- Calculate String Length
- Remove Spaces
- Remove Line Breaks
- Remove Empty Lines
- Remove Duplicate Lines
- Word Counter
- Replace Space with hyphen
- Check Armstrong number
- Text to URL

- Algorithm and Flowchart to check whether an array is mirror inverse or not
- Algorithm and Flowchart to Swap Two Integer Numbers with and without third variable
- Pseudocode And Flowchart for Generating 100 Prime Numbers
- Algorithm and Flowchart to check whether a string is Palindrome or not
- Pseudocode and flowchart to find the series of S= 1 - 3 + 5 - 7 + 9