Login and Register ×
Check your Email for the OTP
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Explanation:
Searching an element in a balanced binary search tree has a time complexity of O(log N), where N is the number of nodes.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Introduction Time Complexity