Smallest value in Max heap can be searched in? code example

Example: max-heap might the smallest element reside,

In a max heap the smallest element will be one of the leaf nodes.
T(n) = O(n) for finding the smallest element in a max heap.