Heaps Quiz

What are the two storage rules that make heaps special?

• The tree is a complete binary tree

• Every level except the deepest must have as many nodes as possible

• A parent's item is never less than the item of any of its children

• The item contained in a node is greater than or equal to the items of the node's children

How can a heap be implemented using an array?

• By storing the root node in position 1 and locating the children randomly

• By storing the root node in position 1 and locating the children mathematically

• By storing the root node in position 0 and locating the children mathematically

• By storing the root node in position 0 and locating the children randomly

What is a priority queue?

• A queue in which items are stored based on their insertion order

• A queue in which items are stored based on their alphabetical order

• A queue in which each item has a priority assigned to it

• A queue in which items are stored based on their numerical order

What are the two key operations for a heap?

• Adding a new entry and removing the entry with the highest priority

• Adding a new entry and removing the entry with the middle priority

• Adding a new entry and removing the entry with the lowest priority

• Adding a new entry and removing any random entry

What is the first step in adding a new entry to a heap?

• Swap the new entry with the highest priority child node

• Swap the new entry with the right child node

• Swap the new entry with the left child node

• Swap the new entry with the parent node

What is the first step in removing an entry from a heap?

• Return the entry stored in the right child node

• Return the entry stored in the highest priority child node

• Return the entry stored in the root node

• Return the entry stored in the left child node

What is the process called when reheapifying a heap upward?

• Reheapification upward

• Reheapification downward

• Heapification upward

• Heapification downward

What is the process called when reheapifying a heap downward?

• Reheapification upward

• Reheapification downward

• Heapification upward

• Heapification downward

Which algorithm is used to efficiently build a heap from an unordered array?

• Quick Sort

• Heapify

• Bubble Sort

• Merge Sort

What is the second way to build a heap from a given set of node values?

• Sorting the nodes in ascending order

• Inserting new nodes one at a time

• Sorting the nodes in descending order

• Swapping nodes randomly