The worst case running time to search for an element in a balanced binary…
PYQ GATE 2012
The worst case running time to search for an element in a balanced binary search tree with elements is
- A.
- B.
- C.
- D.
Attempted by 844 students.
Sign up free to check your answer
Sign up freeLoading lesson…

