(a) Consider a heap stored in an array a= [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when we apply extractMax operation. (b) Consider the same heap a = [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when we apply the operation insert (24). (c) Specify the best-case running time of extractMax() in a heap formed by n distinct items. If your answer is e(f(n)), you must provide an example, with large n, for which extractMax() takes (f(n)).
(a) Consider a heap stored in an array a= [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when we apply extractMax operation. (b) Consider the same heap a = [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when we apply the operation insert (24). (c) Specify the best-case running time of extractMax() in a heap formed by n distinct items. If your answer is e(f(n)), you must provide an example, with large n, for which extractMax() takes (f(n)).
Related questions
Question
![(a) Consider a heap stored in an array a = = [25, 17, 23, 14, 8, 21, 12,7]. Write the updated
array when we apply extractMax operation.
(b) Consider the same heap a = [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when
we apply the operation insert (24).
(c) Specify the best-case running time of extract Max() in a heap formed by n distinct
items. If your answer is (f(n)), you must provide an example, with large n, for which
extract Max() takes (f(n)).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4575c695-56bc-4a6a-843f-ec886ca258f2%2F6a50012f-0808-4043-bd18-34766608f7a9%2Fronlkvp_processed.png&w=3840&q=75)
Transcribed Image Text:(a) Consider a heap stored in an array a = = [25, 17, 23, 14, 8, 21, 12,7]. Write the updated
array when we apply extractMax operation.
(b) Consider the same heap a = [25, 17, 23, 14, 8, 21, 12, 7]. Write the updated array when
we apply the operation insert (24).
(c) Specify the best-case running time of extract Max() in a heap formed by n distinct
items. If your answer is (f(n)), you must provide an example, with large n, for which
extract Max() takes (f(n)).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 7 steps with 2 images
