Question $32$

Answer saved Marked out of $1\mathrm{.}00$

If binary search tree has $N$ nodes, the the maximum height is

Select one:

a$.log(N+1)-1$

b$.\frac{N}{2}$

c$.$ N$-1$

d$.log(\frac{N+1}{2})$

Clear my choice