Q. 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)

💬 Discuss

✅ Correct Answer: (D) O(n), O(logn)

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:20 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

686

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate