Question

What is the worst-case time complexity for searching an element in a general (unbalanced) binary tree?

A O(1)
B O(log n)
C O(n)
D O(n log n)
E O(n^2)
Practice Next

Hey! Ask a query