Login and Register ×
Check your Email for the OTP
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Explanation:
Binary search in a balanced BST has a time complexity of O(log N) where N is the number of elements. This is due to the logarithmic reduction in the search space with each comparison.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Introduction Time Complexity