Answers for "In a min-heap the 10th smallest element can be found in time"

1

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 "In a min-heap the 10th smallest element can be found in time"

Browse Popular Code Answers by Language