In a heap array the root is at index 0. Where are the children of index 1?

• 2 and 3
• 3 and 4
• 1 and 2

A priority queue holds several tasks. Which task comes out first?

• The most important one
• The one added last
• The one that arrived first

In a min heap, every parent is no larger than its children, so the smallest item sits at the root.

Circle one:   True   False

The root is removed from a heap with several items left. What is the repair?

• Move the last item to the root and sift down
• Shift every item one slot left
• Append a copy of the root

A new item lands in a heap and breaks the value rule with its parent. What do you do?

• Move it straight to the root
• Swap it with the smaller child
• Swap it with its parent and keep sifting up

In a heap array with the root at index 0, a node sits at index 2. What index holds its left child?

Answer: ______________

A teammate keeps a sorted list and calls removal instant but inserts painful. What do you suggest?

• Store items unsorted and scan every time
• Keep the list, since inserts are already cheap
• Switch to a heap so both insert and extract cost log n

Why do heap insert and extract each cost log n?

• They scan the whole array
• Each fix walks a single root to leaf path
• They sort the array after every step