GATE | GATE CS 2021 | Set 1 | Question 20

Last Updated :
Discuss
Comments

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?

Θ(nlogn)

Θ(n)

Θ(logn)

Θ(1)

This question is part of this quiz :

Top MCQs on Divide and Conquer Algorithm with Answers,Top MCQs on Binary Search Tree (BST) Data Structure with Answers,GATE CS 2021 | Set 1,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy