Teaching BPSC 4.0 बिहार उच्च माध्यमिक शिक्षक भर्ती (PGT) Mock Test Programming and Data Structure Binary Heap Binary Search Tree
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?
1
Θ(1)
2
Θ(n log n)
3
Θ(log n)
4
More than one of the above
5
None of the above