For a balanced binary search tree with n elements, the time required to search…
Coal India Management Trainee CBT · 2019 · 2020 Systems · Paper II · Domain KnowledgeModified — slightly modified from the official paper; see the solution
For a balanced binary search tree with n elements, the time required to search a given element is:
- A.
O(log n)
- B.
O(n log n)
- C.
O(n² log n)
- D.
O(n²)
Attempted by 1587 students.
Sign up free to check your answer
Sign up freeLoading lesson…