9.4.1. Inserting a Node into the Heap

Try these first

1. 1.

   What is a heap?

   Hint

   Think about a tree structure used to prioritize elements.

2. 2.

   What does the max heap property require?

   Hint

   Consider how numbers compare between parent and child.

3. 3.

   What is a core property of a heap?

   • 1. Random Structure
   • 2. Max Heap Property
   • 3. Tree Node Only

   Hint

   Recall the definitions and properties we covered.

4. 4.

   True or False: The structure of a heap allows for any node position to be filled randomly.

   • True
   • False

   Hint

   Think about how we discussed constructing the heap.

5. 5.

   Given a series of integers, insert them one by one into a max heap and show the steps taken after each insertion to maintain the heap property.

   Hint

   Make sure to check against parents after each insertion!

6. 6.

   The following structures show trees. Determine if they are heaps and explain why or why not.

   Hint

   Mark the violations if found!