9.2. Heap Structure and Properties

Try these first

1. 1.

   What defines a max heap?

   Hint

   Focus on parent-child relationships.

2. 2.

   Describe the shape property of a heap.

   Hint

   Think about how nodes are structured.

3. 3.

   What is the primary property of a max heap?

   • The root is the smallest value
   • Every parent is greater than its children
   • All levels except the last are filled

   Hint

   Think about the relationships between parent and child.

4. 4.

   True or False: A max heap can have gaps between nodes?

   • True
   • False

   Hint

   Recall the definition of a complete binary tree.

5. 5.

   Construct a max heap from the following sequence of integers: 10, 20, 5, 6, 1, 30.

   Hint

   Remember to 'bubble up' after each insertion as necessary.

6. 6.

   Design an algorithm to delete the max element in a max heap and illustrate with an example.

   Hint

   Follow the process closely to maintain the heap.