The worst case complexity for searching an element in binary search tree is…
KVS PGT Computer Science · 2018 · PGT Computer Science
The worst case complexity for searching an element in binary search tree is _____.
- A.
O(log n)
- B.
O(nlgn)
- C.
O(n²)
- D.
O(n)
Attempted by 2371 students.
Sign up free to check your answer
Sign up freeLoading lesson…