Register

GATE CSE 2004 | Question: 4, ISRO2009-26

• edited by
22,659 views
27 votes
27 votes

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 by
User Avatar

6 Answers

–3 votes
–3 votes
Why not height at root considered as 0
As per that the height is 2
Please correct me
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

32 votes
32 votes
5 answers
2
Kathleen asked Sep 18, 2014
12,944 views
GATE CSE 2004 | Question: 38, ISRO2009-27
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times, +, -$ ... $-+a\times bc \ \ \hat{} \ \ \ \hat{} \ \ def$
Assume that the operators $+, -, \times$ are left associative and $^\hat{}$ is right associative. The order of precedence (from highest to lowest) is $ \ ^\hat{}, \times,...
User Avatar
25 votes
25 votes
3 answers
3
Kathleen asked Sep 16, 2014
23,511 views
GATE CSE 2003 | Question: 19, ISRO2009-24
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ ... $9 \ 8 \ 6 \ 4 \ 2 \ 3 \ 0 \ 1 \ 5 \ 7$
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering o...
User Avatar
103 votes
103 votes
11 answers
4
Kathleen asked Sep 18, 2014
33,198 views
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ...
User Avatar
Link Copied!