Write a recursive function that searches a Binary Search Tree for value k. The following numbers are inserted into an empty binary search tree in the given order. 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? (A) 2 (B) 3 (C) 4 (D) 6 Construct the Binary Search tree taking the above mentioned values in question 7 and do the preorder inorder, postorder traversal. Balance the following trees using rotations. Draw the result after each rotation