NIELIT Scientist B 2020 November: 106

Question

Suppose we have to insert the following sequence of keys into an empty binary search tree:

$\text{5, 7, 45, 60, 50, 23, 15, 54}$

What would be the height of binary search tree?

• A. $3$
• B. $4$
• C. $5$
• D. $6$

Answer 1

The height of the tree is the longest path from the root to any leaf node.

In BST insertion value less than the root goes to the left side and a value greater goes to the right side of the root.

Option $C$ and $D$ both are correct here.

NOTE 1) if the root node is at hight=0 then the height of the tree is $5$.

           2) If the root node is at hight=1 then the height of the tree is $6$. 

BST simulator

Comments

root height =0 or 1 ?

as per me, there is no standard reference for it. So option D also correct.

---

 Shaik Masthan yes, you can take. both options are correct.

---

Height of the tree is the number of edges in the tree from the root to the deepest node. So answer is clearly C. i.e. 5

Answer 2

Option D is correct .

root node is at height = 1 then the height of the tree is 6 .