9.3. Examples of Heaps

Try these first

1. 1.

   What is a heap?

   Hint

   Think about its purpose in managing priorities.

2. 2.

   What makes a max heap?

   Hint

   Recall the definition of a max heap.

3. 3.

   What operation retrieves the maximum element from a heap?

   • Insert
   • Delete Max
   • Get Min

   Hint

   Think about which operation deals with the priority.

4. 4.

   Is it true that any binary tree is a heap?

   • True
   • False

   Hint

   Remember the properties of a heap.

5. 5.

   Design a heap from the numbers [15, 10, 2, 1, 8, 5]. Describe the steps you take to build it.

   Hint

   Be cautious about rearranging numbers as you insert.

6. 6.

   If you have a valid heap and remove the max element. What must happen next? Create a list of steps showing the process.

   Hint

   Visualize how the last element fills the void.