Open In App

ISRO | ISRO CS 2009 | Question 26

Last Updated : 04 Jun, 2018
Like Article
Like
Save
Share
Report

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:

So, height of the tree is 3, option (B) is correct.

Quiz of this Question


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads