What are the worst case and average case complexities of a binary search tree?
A. O(n), O(n)
B. O(logn), O(logn)
C. O(logn), O(n)
D. O(n), O(logn)
Answer:D
What are the worst case and average case complexities of a binary search tree?
A. O(n), O(n) B. O(logn), O(logn) C. O(logn), O(n) D. O(n), O(logn)