heapq_example.py

import heapq

# you have to create the list yourself
heap = [some list]

# heapq will modify your list in place!

# Organize the heap as a heap.
# Worst case time complexity: O(n log(n))
# Average time complexity: O(1)
heapq.heapify(heap)
# Add a value and reorganize the heap. O(log n)
heapq.push(heap, value)
# Pop the smallest value and reorganize the heap O(1)
smallest_value = heapq.pop(heap)