9.3.3. Invalid Heap Example

Try these first

1. 1.

   Define a max heap.

   Hint

   Think about the relationship between parents and children in a tree.

2. 2.

   What is the structural property of a heap?

   Hint

   How do nodes fill up in a perfect binary tree?

3. 3.

   What is a max heap?

   • A tree where parent nodes are smaller than children
   • A complete binary tree where parents are greater than children
   • An unordered binary tree

   Hint

   Focus on the relationship between parent and child values.

4. 4.

   True or False: Heaps can have missing nodes in their structure.

   • True
   • False

   Hint

   Recall what defines a complete binary tree.

5. 5.

   Given a sequence of values [40, 30, 20, 10, 50], create a max heap. Then demonstrate the insert operation by adding a new value of 35.

   Hint

   Remember the insertion order for heaps.

6. 6.

   Design a tree structure that violates max heap property and then explain how to fix it. Provide the new correct structure.

   Hint

   Use the bubble-up mechanism to reestablish the max heap property.