The worst case running time to search for an element in a balanced binary…
GATE · 2012 · CS · Computer Science & IT
The worst case running time to search for an element in a balanced binary search tree with \(n2^n\) elements is
- A.
\(Θ (n \ log \ n)\) - B.
\(Θ (n2^n)\) - C.
\(Θ (n)\) - D.
\(Θ (log \ n)\)
Attempted by 672 students.
Show answer
Correct answer: C
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…