Consider an array with the following 17 keys: 5,21,5,19,3,5,15,22,21,1,1,28,24,11,30,10,13. Using HeapBuild from the lecture build a minimal binary heap stored in this array. After that perform 3-times HeapExtractMin from the lecture and as the last operation perform insertion of key 2 by HeapInsert. Write the keys of heap stored in an array after the last operation as a sequence of numbers separated by a comma and a space. The order of keys is as they are stored in the array, i.e. from left to right.
Answers
Answered by
1
Answer:
What is this? wait what grade are you in becuz ive never seen this
Step-by-step explanation:
Similar questions