The worst case complexity of deleting any arbitrary node value element from heap is

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure (DS)

Q. The worst case complexity of deleting any arbitrary node value element from heap is

(A) O(logn)
(B) O(n)
(C) O(nlogn)
(D) O(n2)

💬 Discuss

✅ Correct Answer: (A) O(logn)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

148

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate