Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.

(a) O(log n)

(b) O(nlog 2)

(c) O(n)

(d) O(1)

My enquiry is from Binary Trees in division Binary Trees of Data Structures & Algorithms I

I had been asked this question in quiz.