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)?
Height is 3
Correct Answer: $B$
ans is (b)
This https://www.cs.usfca.edu/~galles/visualization/BST.html
64.3k questions
77.9k answers
243k comments
79.7k users