Question: What is the time complexity of removing the highest priority element from a binary heap?

Options:

1. O(1)
2. O(log n)
3. O(n)
4. O(n log n)

Correct Answer: O(log n)

Solution:

Removing the highest priority element from a binary heap has a time complexity of O(log n) due to the need to re-heapify.