Question: 3. For the following array: A = <13, 19, 9, 5, 12, 8, 7, 4, 11, 2, 6, 21> {a)Create a max heap using the

3. For the following array: A = <13, 19, 9, 5, 12, 8, 7, 4, 11, 2, 6, 21>

{a)Create a max heap using the algorithm BUILD-MAX-HEAP.

(b) Remove the largest item from the max heap you created in 3(a), using the HEAPEXTRACT-MAX function. Show the array after you have removed the largest item

(c) Using the algorithm HAX-HEAP-INSERT, insert 56 into the heap that resulted from question 3(b). Show the array after insertion.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

I need help generating solid pseudocode for this algorithm I'm creating. It runs in O(n + klogk). I need to get the k largest elements in an array of size n. We will have 2 max heaps, and 1 array of...

For the following array: A 20, 13, 5, 10, 12, 8, 1, 9, 3, 11, 2, 6, 21> (a) Create a max heap using the algorithm BUILD-MAX-HEAP. (b) Remove the largest item from the max heap you created in 3(a),...

For the following array: A= 20,> (a) Create a max heap using the algorithm BUILD-MAX-HEAP. (b) Remove the largest item from the max heap you created in 3(a), using the HEAP-EXTRACT-MAX function. Show...

Compute the asymptotic run time and space complexity for all the methods in the following code: public class MaxHeap { // Instance variables private Integer[] heap; private int capacity; // Amount of...

********IN JAVA********** The problem is to convert the given Max Heap into a binary search tree (BST) with the condition that the final BST needs to be also a complete binary tree. Note We assume...

What do you mean by Heapify? code must be done in c++ thank you heapify . (algorithm) Definition : Rearrange a heap to maintain the heap property, that is, the key of the root node is more extreme...

********IN JAVA********** The problem is to convert the given Max Heap into a binary search tree (BST) with the condition that the final BST needs to be also a complete binary tree. Note We assume...

*****Java***** NOTE: You can only change the below class HW8_P3 class HW8_P3{ // write your code, you can add more methods public static BST convert(MaxHeap maxHeap){ The problem is to convert the...

Assume that a March futures contract on Mexican pesos was available in January for $.09 per unit. Also assume that forward contracts were available for the same settlement date at a price of $.092...

In the planetary gear system shown, the radius of gears A, B, C, and D is 60 mm and the radius of the outer gear E is 180 mm, knowing that gear E has an angular velocity of 120 rpm clockwise and that...

To offset an existing long put position, an option trader must take which of the following actions? Buy a put Sell a put Buy a call Sell a call

Discuss the policy statement concept and identify three focus areas / procedures where a clearpolicy statement / operating procedure

Which of the following is a characteristic of a focus group? a It has two or three participants. b It enables you to study decision-making processes in a group situation. c It is a way to get people...

How might you ensure that you take into account any biases (such as a management perspective) in the documents that you analyse?

How can you check on the meaning and significance of some of the terms and expressions used within any organisational sources that you study?