Question: Which of the following operations can be performed in O(log n) time in a binary heap?

Options:

1. Insertion
2. Deletion of the maximum element
3. Heapify
4. All of the above

Correct Answer: All of the above

Solution:

All of the listed operations (insertion, deletion of the maximum element, and heapify) can be performed in O(log n) time in a binary heap.