Test Index

GATE Computer Science (CS) 2021 Shift 1 Solved Paper

© examsnet.com

Question : 20

Total: 65

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)
Θ(n log n)
Θ(log n)
Θ(n)

Go to Question:

Prev Question

Next Question