If n elements are sorted in a balanced BST. What would be the asymptotic complexity to search

Question:

If n elements are sorted in a balanced BST. What would be the asymptotic complexity to search a key in the tree? 

A. A O(1)

B. O(logn)

C. O(n)

D. O(nlogn)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: