Question

NOTE:  Completing the Third Chart is the most important. This is one question with three parts.

(4 pts) Is the following array-based tree a min-heap or a max-heap or not a heap at all? 85 91 S8 95 100 92 a. Min-heap b. Max-heap c. Not a heap 5 pts) Turn the following array-based binary tree into a max-heap. Show your work step by step. (You will not need all the columns) 34 7 12 47 19 5 pts) Show the first pass of sorting the following array-based binary tree max-heap. In other words, show the first step in sorting, then re-heap the remaining tree into a max-heap. (You will not need all the columns) 50 49 37 39 41 17 20

Answer 1

Answer : Part One : (a) Min - heap.

85 85 io lessthn 91 91 88 than 0 38 65 34 4 47 12 55 47 12- 川似-ha 了3 341341 55135 34 3355343 55| 55 | 33 47 47 47 1/2

5 0 49 20 37 39 41 17 20 3947 49 20件 39 4149 20 41 37 37 37 St 3937 3 41412D