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 Answer: (B) Explanation: See question 3 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-3/Quiz of this Question