📅  最后修改于: 2022-03-11 14:56:55.006000             🧑  作者: Mango
代码示例1
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.