Time complexity to get min elements from max-heap

Question

I was asked in an interview:

What is the best time complexity in getting the min element(s) from a max-heap?

I replied as O(1) a

Answer 1

Min element from Max heap :

1. search at last level = O(n/2)= O(n)

2. replace searched element with last element and decrease heap size by 1 = O(1)

3. Apply Maxheapify on replaced element = O(log n)

Total Time = O(n)+O(1)+O(log n) = O(n)