9.2.2. Heap Shape and Value Property

Try these first

1. 1.

   What is a heap?

   Hint

   Think about how it relates to priorities.

2. 2.

   Describe the shape property of a heap.

   Hint

   How do we add elements?

3. 3.

   What is the main operation to retrieve the highest priority job in a max heap?

   • Delete Min
   • Insert
   • Delete Max

   Hint

   Think about the name of the operation.

4. 4.

   True or False: In a max heap, child nodes can have values greater than their parent node.

   • True
   • False

   Hint

   Consider the definition of max heaps.

5. 5.

   Given the following elements, insert them into a max heap: 20, 15, 30, 25, 10, 5. Show the steps, including any necessary adjustments.

   Hint

   Remember to bubble up when the max heap property is violated.

6. 6.

   Explain why a completely filled binary tree with violations cannot function as a max heap, using an example.

   Hint

   What does the max heap definition tell you?