Question 14080 – NIC-NIELIT Scientist-B 2020

Suppose we have to insert the following sequence of keys into an empty binary search tree:
5, 7, 45, 60, 50, 23, 15, 54
What would be the height of binary search tree?

Correct Answer: C

Question 98 Explanation:

The explanation saying the tree height would be the number of edges in the longest simple downward path from root to leaf. According to this the height must be 5 for the given question.
BST with the elements is as follows

It is a very easy question. By default height starts from 0.