Q6

MCQ1 mark, −0.33

Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$ .

(A)

$4$ and $15$ respectively.

(B)

$3$ and $14$ respectively.

(C)

$4$ and $14$ respectively.

(D)

$3$ and $15$ respectively.

Loading…