What is the time complexity for deletion from a Maximum Heap? A. O(l) B. O(log n

Question

What is the time complexity for deletion from a Maximum Heap? A. O(l) B. O(log n) C. O(n) D. O(n log n) E. O(n^2) What is the time complexity for creating a Minimum/Maximum Heap by inserting all the given elements one by one? A. O(l) B. O(log n) C. O(n) D. O(n log n) E. O(n^2) What is the time complexity for creating a Minimum/Maximum Heap by using the Heapify method? A. O(l) B. O(log n) C. O(n) D. O(n log n) E. O(n^2) What is the time complexity for searching a key from a Hash Table? A. O(l) B. O(log n) C. O(n) D. O(n log n) E. O(n^2) What is the time complexity for insertion to a Hash Table without collisions? A. O(l) B. O(log n) C. O(n) D. O(n log n) E. O(n^2)

Explanation / Answer

12. What is time complexity for deletion from a maximum heap?

Ans: O(log n)

13. What is the time complexity for creating a Minimum/Maximum Heap by inserting all the given elements one by one?

Ans: O(log n)

14. What is the time complexity for creating a Minimum/Maximum Heap by using the Heapify method?

Ans: O(log n)

15. What is the time complexity for searching a key from hash table?

Ans: O(1)

16. What is the time complexity for insertion to a hash table without collision?

Ans: O(1)

Note: All the above complexities are for average case scenario.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.