The worst case running time to search for an element in a balanced binary…

GATE · 2012 · CS · Computer Science & IT

1. A.

   $Θ (n \ log \ n)$

2. B.

   $Θ (n2^n)$

3. C.

   $Θ (n)$

4. D.

   $Θ (log \ n)$

Attempted by 711 students.