Balanced binary tree with n items allows the lookup of an item in ____

1.	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)
Answer» B. O(nlog 2)

Discussion