GATE CSE 2004 | Question: 4, ISRO2009-26

Question

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 1

Height is 3

Answer 2

Why not height at root considered as 0
As per that the height is 2
Please correct me

Comments

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 ....