Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
Trending Now
DSA
Web Tech
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
System Design
Django
DevOps Tutorial
Java
C
C++
ReactJS
NodeJS
CP Live
Aptitude
Puzzles
Projects
C Input and Output
C Operators
C++ Constructors
C Loops & Control Structure
C Structure & Union
C Macro & Preprocessor
GATE CS 2012
OS Process Management
CN Data Link Layer
Top MCQs on Binary Search Tree (BST) Data Structure with Answers
Question 41
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)
Discuss it
1
2
3
4
5
There are 41 questions to complete.
Last Updated :
Take a part in the ongoing discussion
View All Discussion
Trending in News
View More
How to Get Smooth Stone in Minecraft
OpenAI Announces GPT-4o Omni
How to Fix Your PS5's IP Address Problem in Minutes (Quick Guide)
10 Best Free Reverse Phone Number Lookup
What is an API (Application Programming Interface)