A binary search tree \(T\) contains \( n\) distinct elements. What is the time…
GATE · 2021 · CS · Set 1 · Computer Science & IT
A binary search tree contains distinct elements. What is the time complexity of picking an element in that is smaller than the maximum element in ?
- A.
- B.
- C.
- D.
Attempted by 849 students.
Sign up free to check your answer
Sign up freeLoading lesson…