Question

how to convert infix to postfix in data structure .
give the procss

Answer 1

suppose the infix expression is a+b*c-d
1.Find the operator with the smallest precedence.It will be operated at last
here,+ and - have the lowest precedences..take the last operator amongst them..that is -
now paranthesize like this (a+b*c)-(d)
2.do step 1 on the paranthesis (a+b*c)...we will get ( (a)+(b*c) ) this can be written as a+(bc*) or abc*+ ...
now we have, (abc*+)-(d) that is ,abc*+d- is the post fix

Answer 2

it sounds confusing...but let me know if you have doubts...I suck at explaining without a 1 V1 talk...