tree(atree (bbinary tree for the dashed edges connect nodes of that are siblings in - as mentioned in exercise - ,postfix notation is an unambiguous way of writing an arithmetic expression without parentheses it is defined so that if "(exp )op(exp )is normal (infixfully parenthesized expression with operation opthen its postfix equivalent is "pexp pexp op"where pexp is the postfix version of exp and pexp is the postfix version of exp the postfix version of single number of variables is just that number or variable sofor examplethe postfix version of the infix expression "(( ( ))/ is " /give an efficient algorithm for converting an infix arithmetic expression to its equivalent postfix notation (hintfirst convert the infix expression into its equivalent binary tree representationusing the algorithm of code fragment - given proper binary tree tdefine the reflection of to be the binary tree such that each node in is also in 'but the left child of in is ' right child in and the right child of in is ' left child in show that preorder traversal of proper binary tree is the same as the postorder traversal of ' reflectionbut in reverse order - algorithm preorderdraw draws binary tree by assigning xand ycoordinates to each node such that (vis the number of nodes preceding in the preorder traversal of and (vis the depth of in algorithm