Please help me with a code which converts a postfix notation to an infix using trees, stack or linked list?

I am trying to write a program which takes a postfix expression as an input and provides an infix form of the expression. It can use expression trees, linked lists or stack. I have searched everywhere online but could only find infix to postfix conversion programs. Program in any language will be fine.


An example of this is: Post fix expression: 45+


And Infix Expression: (4+5)


Thanks

Please help me with a code which converts a postfix notation to an infix using trees, stack or linked list?
Hi simi,


visit:


http://www.mckoi.com/database/maillist/m...


It may help you. Look for class named "Expression". Ignore other things.

polish