Priority queue in python standard lib

PriorityQueueSTL.py

import heapq

items = [1,2,3,4,5]
pq = []

# Push element onto the heap (adding)
# Note that heapq is min heap by default so smallest element gets max priority
for i in items:
  heapq.heappush(pq,i)
  
# pop element from heap (polling)
item = heappop(pq)

# push element and pop element from the heap at the same time
item = heapq.heappushpop(pq, 5)

# Transform list into a min heap in O(n) time aka Construction
lst = [3,5,6,2,9,1]
heapq.heapify(lst)