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

MINIMUM_ELEMENT -> it will take O(n) time in case of Max heap and O(1) in case of Min heap. MAXIMUM_ELEMENT -> it will take O(1) time in case of Max heap and O(n) in case of Min heap.