Career Tracks
Exams
MCQ
Companies
Opportunities
Pricing
MCQ Practice
Data Structures
Trees
Question
Medium
What is the time complexity of searching in a balanced BST?
A
O(1)
B
O(n)
C
O(log n)
D
O(n log n)
Show Answer
← Back to Trees questions
What is the time complexity of searching in a balanced BST? | Trees MCQ | TomoLink | TomoLink
