20 40 15 75 Q3: For the input given below construct a binary search tree. 60 70 10 80 50 45 30 25 a) The in-order traversal of the tree is: b) The pre-order traversal of the tree is: c) The post-order traversal of the tree is: Q5: Create an expression tree for the infix string 10 -2 * 4+ 7/2 + 5