1- Convert the following infix expression to postfix expression using stack. n-y +z* 2/t*(y^3^x) 2- Find the binary tree whose preorder traversing is 10, 20, 30, 40, 50, 60, 70, 80, 90 and whose inorder traversal is 10, 20, 30, 40, 50, 60, 80, 70,90 3- Define the data structure of a binary tree containing integer values and then write a JAVA method count() such that count ( T ) returns the number of nodes ( which have right child only ) in a binary tree headed by T. (Recursion) ( 4- Given following figure : ( Nodes ) Example: 10 a- Define the data structure for the above figure. b- Convert the following instructions to JAVA statements (Using the defined data structure in a): Stepl: create a new node 1151 Step2 : insert the new node as follow