How does heapq work in Python?

Can you explain how the heapq module works in Python?

Sure! The heapq module provides an implementation of the heap queue algorithm, also known as the priority queue algorithm.

How do I create a heap using heapq?

You can create a heap by using the heapify function, which transforms a list into a heap in-place.

What are some common operations I can perform with heapq?

Common operations include heappush to add an element, heappop to remove the smallest element, and heappushpop to push and pop in one atomic operation.

Can you give me an example of using heapq?

Certainly! Here's a simple example:

import heapq
heap = []
heapq.heappush(heap, 5)
heapq.heappush(heap, 1)
heapq.heappush(heap, 3)
print(heapq.heappop(heap))  # Outputs: 1