9.3.2. Valid Heap Example 2

Try these first

1. 1.

   What is the main purpose of heaps in data structures?

   Hint

   Think about how tasks are scheduled based on priority.

2. 2.

   List two properties of heaps.

   Hint

   Recall how the tree is structured.

3. 3.

   What operation is used to remove the highest priority job from a max heap?

   • Insert
   • Delete Max
   • Heapify

   Hint

   Think about the role of the root node in a heap.

4. 4.

   A max heap must ensure that every parent is greater than its children. True or False?

   • True
   • False

   Hint

   Consider what happens in the tree structure.

5. 5.

   Given the following set of numbers to insert into a max heap: [5, 10, 3, 12, 7], illustrate the steps taken to maintain the max heap property after each insertion.

   Hint

   Visualize after each step.

6. 6.

   Construct an example of an invalid max heap and explain how you would fix it.

   Hint

   Think about maintaining the parent-child relationship after any modification.