Question: What is the primary advantage of using a binary heap over an unsorted array for implementing a priority queue?

Options:

1. Faster insertion
2. Faster deletion
3. Better memory usage
4. Easier implementation

Correct Answer: Faster deletion

Solution:

A binary heap allows for faster deletion of the maximum (or minimum) element compared to an unsorted array, where deletion would take O(n) time.