Query on data structures


#1

The time complexity for finding the smallest number among n elements in binary max heap is


#2

O(n) since it can be present in any leaf node so you have to traverse the whole tree.


#3

Yes it’s correct.The answer is O(n) and the reason is also true