I am trying to get pseudo code for this.
Scan the string from left to right for each char If the operand adds it to the string Otherwise, if the operator adds to the stack ....
I am struggling on how to handle () s
Have you tried these links yet?
http://www.geocities.com/e_i_search/premshree/web-include/pub/infix-postfix/index.htm
http://code.activestate.com/recipes/228915-infixpostfix/
I'm a little rusty, but when you come across '(' you push it onto the stack because it has the highest priority. I can't remember what to do when you come across ')' but I think it goes to stack because it has the highest priority.
( goes onto the stack and then when you get to ) , you pop off the stack until you find ( .
(
)
Wikipedia has a more detailed description of the algorithm, the supporting functions, and the operators.