I need this to be implemented using Java as well please use binary tree

3.59 As mentioned in Exercise C-6.19, postfix notation is an unambiguous way of writing an arithmetic expression without parentheses. It is defined so that if " (exp1) op (exp2) " is a normal (infix) fully parenthesized expression with operaversion of exp1 and exp2 is the postfix version of exp2. The postfix version of a single number or variable is just that number or variable. So, for example, the postfix version of the infix expression " ((5+2)(83))/4 " is "5 2+83 4 /". Give an efficient algorithm for converting an infix arithmetic expression to its equivalent postfix notation. (Hint: First convert the infix expression into its equivalent binary tree representation.)