GATE Computer Science (CS) 2021 Shift 1 Solved Paper
© examsiri.com
Question : 20 of 65
Marks:
+1,
-0
A binary search tree T contains n distinct elements. What is the time complexity of picking an element in T that is smaller than the maximum element in T?
Go to Question: