Which data structure does Python’s `heapq` module implement?

Question

Python Professional — Hard

Which data structure does Python’s `heapq` module implement?

Accepted Answer

Python's `heapq` module implements a Min-heap data structure. This means that the smallest element is always at the root. In contrast, a Max-heap would have the largest element at the root, making option A incorrect.