1.
What is the time complexity of searching for an element in a balanced Binary Search Tree (BST)?
A
O(1)
B
O(n)
C
O(log n)
D
O(n log n)
Loading subject questions
Explore topic-wise data-structures questions.
1 questions · Page 1 of 1
What is the time complexity of searching for an element in a balanced Binary Search Tree (BST)?
O(1)
O(n)
O(log n)
O(n log n)