Suppose a BST contains n distinct keys and is completely skewed. The…
RSSB Computer Instructor · 2026 recruitment · Senior Computer Instructor · Paper II
Suppose a BST contains n distinct keys and is completely skewed. The worst-case time complexity for searching an element is:
- A.
O(n log n)
- B.
O(1)
- C.
O(log n)
- D.
O(n)
- E.
Question not attempted
Attempted by 95 students.
Sign up free to check your answer
Sign up freeLoading lesson…