Algorithms Searching, Sorting and Hashing Sorting

In a binary max heap containing n numbers, the smallest element can be found in ______ time.  

1
O(n)
2
O(log2 n)
3
O(1)
4
O(log2 log2 n)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters