9.2.2.1. Max Heap Property

Try these first

1. 1.

   What is the primary property of a Max Heap?

   Hint

   Think about the structure of a Max Heap.

2. 2.

   How are heaps filled?

   Hint

   Visualize how a tree grows.

3. 3.

   In a Max Heap, which is true?

   • The root is the smallest element
   • The root is the largest element
   • Children can be larger than their parent

   Hint

   Think about the definition of a Max Heap.

4. 4.

   True or False: Insertion in a Max Heap can occur anywhere in the tree.

   • True
   • False

   Hint

   Recall the ordering rules of heaps.

5. 5.

   You have a Max Heap containing the elements {30, 20, 10}. If we insert 25, what is the new configuration of the heap?

   Hint

   Consider where 25 would sit and check upward for correctness.

6. 6.

   Explain the worst-case time complexity of insertion and deletion in a Max Heap, and demonstrate one operation.

   Hint

   Use examples to illustrate how many swaps might occur.