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)

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)

Step by Step Solution

3.45 Rating (152 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures and Other Objects Using Java Questions!