You need time to create a binary max heap from an unordered array. 

The height of a tree representing a binary min heap with elements is always .

You can find a minimum in binary min heap in time. 

A sorted array is a binary min heap. 

You can remove a minimum from binary max heap in  time.