Heap | in Python | Question 7

Last Updated :
Discuss
Comments

What is the time complexity of finding the smallest element in a heap?

O(log n)

O(n)

O(1)

O(n log n)

This question is part of this quiz :

Heap in Python
Tags:
Heap
Share your thoughts in the comments