i need to say : Where can be a maximum element in a min heap when all the elements are different?
$\begingroup$
$\endgroup$
The maximum is one of the heap’s leaves. You can’t know which one. You for optimizing your algorithm, you can scan only the leaves, which in case the heap is implemented with an array, requires scan of maximum of (n+1)/2 nodes (which is still O(n))
$\begingroup$
$\endgroup$
The best way to do this would be to iterate over all the items at the bottom of the heap.
