Question: What is the worst-case time complexity for deleting the minimum 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:

Deleting the minimum element from a binary heap takes O(log n) time as it requires re-heapifying the structure.