Question

What are the worst case and average case complexities of a binary search tree? *



1. O(n), O(n)

2. O(logn), O(logn)

3. O(logn), O(n)

4. O(n), O(logn)


​

Answer 1

Answer:

4.O(n),O(logn) this is the correct answer thank you