Write a program that transforms a given postfix expression into a binary tree such that the traversal of the tree will yield the postfix, infix and prefix equivalents of the algebraic expression. Please do the program recursively as we discussed in class.

Hint(s): The infix expression will need parentheses to avoid generating ambiguous expressions. In the inOrder() method, display an opening parenthesis before the first recursive call and a closing parenthesis after the second recursive call.

Write code in c++