2.8k views

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)?

1. $2$
2. $3$
3. $4$
4. $6$
edited | 2.8k views

Height is 3

selected

ans is (b)

Ans) 3

Draw a BST for the given numbers And the Distance from root(i.e 10) to leaf(i.e 5) is 3.
ans will be 3 . hence option (b)
–1 vote
ans b)
Why not height at root considered as 0
As per that the height is 2
+1
Read definition of height of tree ... which is # of longest edges from root to leaves .... and  height of node ... which is # of longest edges from that node to leaves ....