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
Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ1 mark · −1/3 if wrongEasy
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.