**Convert Infix to Postfix Notation**

Initially we’ve a *string* S which represent the expression in infix format. Now we need a character *stack*.

*We’ll iterate through the *string* S, from left to right.

Whenever we encounter an operand we’ll print it.

If we encounter an ‘(‘ we’ll push it to the

*stack*.If we encounter an ‘)’ we’ll take the following actions:

- We’ll continue to pop top of the
*stack*until we find the ’(‘ - Before we pop top of the
*stack*, we’ll print every character of top of the*stack*except ‘)’.

- We’ll continue to pop top of the
If we encounter an operator, we’ll take the following actions:

- We’ll continue to pop top of the
*stack*until we find that S[ i ] is greater than the top of the*Stack*(by the rules of precedence) Ex: if we found an Multiplication operator on S [ i ] We’ll continue searching for addition or subtraction operator on top of the*stack*. We’ll stop searching until it’s empty or we’ve found one. Before that we’ll pop top of the*Stack*. And before pop, we’ll print every operators.

- We’ll continue to pop top of the
When the traversal will finished, we’ll continue to pop top of the

*stack*until it's empty, and before pop we’ll print every operators.

You can see my Code

**Convert Infix to Prefix Notation**

To convert an infix to Prefix, first we’ve to know how to convert Infix to postfix notation.

Initially we’ve a *string* S which represent the expression in infix format.

Reverse the

*string*S. After reversing A+B*C will become C*B+A. Note while reversing each ‘(‘ will become ‘)’ and each ‘)’ becomes ‘(‘.Obtain the postfix expression of the modified

*string*S. We’ve to handle the ‘(‘ as ‘)’ and ‘)’ as ‘(‘Just reverse the postfix expression we’ve.

You can see my Code

If you want to know in details about Infix, Postfix and Prefix This Link maybe help you.

Here are some basic practice problems: WhatFix Notation Equation Convert the Expression

Thank you for reading. If there anything else, please let me know.

I am new in programming.Can you give me link of tutorial of this?

cs

Geeksforgeeks

Thanks

Thank you.

It may be more useful to add, to the blog above, a link to a page that explanes those idioms (infix, prefix and postfix notations), like the first link in the reply to the previous comment, or to explane them before the solving approach.

Ok, I'm gonna add some basic practice problem too, with the link you asked.

Thank you very much :D

Always welcome. And also thank you for the suggestion.

Go Here

After watching this you will become master in converting between these two .

Please check your code with the expression : 2^3^4 It's providing the wrong output, probably due to the precedence function as precedence should also include the left to right precedence of exponential operator and right to left precedence for other operators in case of multiple operators of the same kind.