Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] =...

Transcribed Image Text:

Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] = (12, 8, 15, 5, 6, 14, 1, 10) (in the given order), following Example 4.14. Example 4.14 Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] = (10, 8, 14, 15, 12, 5, 6, 1). Assume the heap is empty initially. 10 1010 114 8 8 14 8 10 8 10 15 10 14 14 10 15 8 8 (a) (b) (c) (c)ii (d)i (d)ii (d)iii 15 15 15 15 10 10 10 8 12 8 12 5 8 12 5 6 12 5 6 (e) (1) (g) 1 (h) Acti Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] = (12, 8, 15, 5, 6, 14, 1, 10) (in the given order), following Example 4.14. Example 4.14 Demonstrate, step by step, how to construct a max-heap for the list of integers A[1..8] = (10, 8, 14, 15, 12, 5, 6, 1). Assume the heap is empty initially. 10 1010 114 8 8 14 8 10 8 10 15 10 14 14 10 15 8 8 (a) (b) (c) (c)ii (d)i (d)ii (d)iii 15 15 15 15 10 10 10 8 12 8 12 5 8 12 5 6 12 5 6 (e) (1) (g) 1 (h) Acti