Python’s heapq module offers a highly efficient min-heap implementation. A min-heap, by definition, keeps its smallest element at the root (index 0). While adding (heappush) and removing (heappop) elements are common operations, frequently you’ll need to examine the smallest element without altering the heap’s structure—a process we call “peeking.” This…