26.1.5. Heaps

Try these first

1. 1.

   What is a heap?

   Hint

   Remember the structure and purpose.

2. 2.

   What does a Min-Heap guarantee about its parent and children?

   Hint

   Think about the smallest value in the tree.

3. 3.

   What is the time complexity of inserting an element into a heap?

   • O(n)
   • O(log n)
   • O(1)

   Hint

   Think about how trees are structured.

4. 4.

   True or False: A Max-Heap allows the parent node to be less than its children.

   • True
   • False

   Hint

   Consider how the elements compare in a Max-Heap.

5. 5.

   You have the array [4, 10, 3, 5, 1]. Build a Min-Heap from this array and show the resulting array representation.

   Hint

   Try to construct the heap level by level while maintaining the properties.

6. 6.

   Explain how the complexity of a sorted array compares to the performance of a heap for insertions and deletions.

   Hint

   Think about how elements are organized in both structures.