Question

In a perfectly balanced Binary Search Tree with N nodes, what is the worst-case time complexity for searching for an element?

A O(1)
B O(log N)
C O(N)
D O(N log N)
E O(N²)
Practice Next

Hey! Ask a query