Balanced binary tree with n items allows the lookup of an item in ____ worst-case time. Q & A › Category: Data Structure › Balanced binary tree with n items allows the lookup of an item in ____ worst-case time. 0 Vote Up Vote Down Admin Staff asked 4 years ago 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) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 0 Vote Up Vote Down Admin Staff answered 4 years ago a) O(log n) Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...