9. Heaps

Try these first

1. 1.

   What is the primary purpose of a priority queue?

   Hint

   Think about how tasks are executed based on urgency.

2. 2.

   What is a heap?

   Hint

   Consider how heaps are structured compared to other trees.

3. 3.

   Which operation removes the highest priority element from a heap?

   • Insert
   • Delete Max
   • Add Element

   Hint

   Remember the operation that focuses on removing elements.

4. 4.

   True or False: The max heap property requires each parent to be less than its children.

   • True
   • False

   Hint

   Think about how parents compare to their children in a binary tree.

5. 5.

   Given the following values, insert them into an empty max heap: 10, 20, 15, 30, 5. Show the steps taken.

   Hint

   Keep track of the parent comparisons during each insertion.

6. 6.

   Construct a min heap from the following elements: 5, 3, 17, 10, 84, 19, 6, 22, 9. Show how to maintain the min heap property.

   Hint

   Remember, each insertion can cause a bubble down to find the correct position.