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

Time complexity and common uses of hash tables would naturally land in the hash table if there were no collisions.

12.option A

13.option b

14.option c

15.option A

16.option c

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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