9.1. Introduction to Heaps

Try these first

1. 1.

   What is the shape property of a heap?

   Hint

   Think about how a tree's structure is defined.

2. 2.

   In a max heap, which is greater, a parent or its children?

   Hint

   Consider how 'max' is defined in 'max heap'.

3. 3.

   Which operation retrieves the highest priority element in a max heap?

   • Insert
   • Delete Max
   • Search

   Hint

   Think about which operation relates to removing the top element.

4. 4.

   True or False: Every child in a max heap must be smaller than its parent.

   • True
   • False

   Hint

   Reflect on the definition of a max heap.

5. 5.

   Given a sequence of numbers, insert them into a max heap one by one. Start with [10, 20, 30]. What does the heap look like after all insertions?

   Hint

   Remember how to maintain the max heap property with each insertion.

6. 6.

   Construct a heap from the following set of values: 15, 10, 20, 8, 30, 25. Show the tree structure.

   Hint

   Think about how to position values to maintain both the shape and value properties.