How can I implement a heap data structure in Python?

How can I implement a heap data structure in Python?

You can implement a heap using a list in Python. Would you like to see a min-heap or a max-heap implementation?

Let's start with a min-heap.

Great! A min-heap can be implemented using the heapq module. Here's a simple example:

import heapq

class MinHeap:
    def __init__(self):
        self.heap = []

    def push(self, item):
        heapq.heappush(self.heap, item)

    def pop(self):
        return heapq.heappop(self.heap)

    def peek(self):
        return self.heap[0] if self.heap else None

    def is_empty(self):
        return len(self.heap) == 0

Would you like to see how to use this min-heap?

Yes, please show me how to use it.

You can use the MinHeap class like this:

min_heap = MinHeap()
min_heap.push(5)
min_heap.push(3)
min_heap.push(8)

print(min_heap.pop())  # Outputs: 3
print(min_heap.peek())  # Outputs: 5

This will demonstrate adding and removing elements from the heap. Do you have any other questions?