This question pertains to heaps (specifically, heaps where the root is the smallest ment a. What...

Transcribed Image Text:

This question pertains to heaps (specifically, heaps where the root is the smallest ment a. What is a heap? What properties must a heap maintain? b. How can we represent a heap by a vector? c. Consider the following sequence: 4, 10, 32, 8, 20, 46, 78, 36, 52, 30. Build a heap by inserting these elements in sequence; show the state of the heap after each insertion; you may use more rows/ columns than provided below, or fewer. This table is provided only for convenience. Explain the principle of heapsort; illustrate it on the heap built in the previous section. You may use table below for this purpose. This question pertains to heaps (specifically, heaps where the root is the smallest ment a. What is a heap? What properties must a heap maintain? b. How can we represent a heap by a vector? c. Consider the following sequence: 4, 10, 32, 8, 20, 46, 78, 36, 52, 30. Build a heap by inserting these elements in sequence; show the state of the heap after each insertion; you may use more rows/ columns than provided below, or fewer. This table is provided only for convenience. Explain the principle of heapsort; illustrate it on the heap built in the previous section. You may use table below for this purpose.

Answer rating: 100% (QA)

Solution a What is a heap What properties must a heap maintain A heap is a specialized tree data str... View the full answer