Register

NIELIT 2022 April Scientist B | Section B | Question: 59

• edited by
591 views
1 votes
1 votes

Let $\text{T}$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $\text{T}$ are:

The height of a tree with a single node is $0$.

  1. $4$ and $15$ respectively
  2. $3$ and $14$ respectively
  3. $4$ and $14$ respectively
  4. $3$ and $15$ respectively
• edited by
User Avatar

1 Answer

0 votes
0 votes

Correct answer is: Option B

Minimum height of BST with 15 nodes = 3
Maximum height of BST with 15 nodes = 14.

(Idea: For minimum height, try to make a complete binary tree and maximum height a skew tree which have a exactly 1 node at each level)

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
4
soujanyareddy13 asked Apr 12, 2022
897 views
NIELIT 2022 April Scientist B | Section B | Question: 50
Match the following: ... $\text{(I)}$ $\text{(II)}$ $\text{(III)}$ $\text{(IV)}$
Match the following:$$\begin{array} {ll} \qquad \quad\textbf{List-I} & \qquad \quad \textbf{List-II} \\ \text{(P) Condition coverage} & \text{(1) Black-box testing} \\ \t...
User Avatar
Link Copied!