3. Consider the following binary heap in an array. root 20 26 55 41 33 60...

 

Transcribed Image Text:

3. Consider the following binary heap in an array. root 20 26 55 41 33 60 31 11 71 17 88 97 8 44 53 30 62 a) Draw a binary heap. b) Show the resulting binary heap after inserting 37. Number of swaps for this insert: c) Based on the answer of a), show the resulting binary heap after one deleteMin operation. 3. Consider the following binary heap in an array. root 20 26 55 41 33 60 31 11 71 17 88 97 8 44 53 30 62 a) Draw a binary heap. b) Show the resulting binary heap after inserting 37. Number of swaps for this insert: c) Based on the answer of a), show the resulting binary heap after one deleteMin operation.