The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

(A) O(n log n)
(B) O(n)
(C) O(n2)
(D) O(log n)

💬 Discuss

✅ Correct Answer: (A) O(n log n)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

713

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate