Thats pretty simple code where you just arrange the postfix expression in binary tree and Inorder traversal gives you infix expression. I don't have the ready code as of now but I guess it would not be that difficult to write as well for you if you have the concept and one part of it