Answers for "where in a max-heap might the smallest element reside, assuming that all elements are distinct"

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.

Posted by: Guest on May-19-2021

Code answers related to "where in a max-heap might the smallest element reside, assuming that all elements are distinct"