JRSETI Wiki

Good Binary Heap Tutorial

enqueue or dequeue items in O(logn)

Priority Queues use a min heap or max heap

prev = None
cur = head
while cur:
  next_node = cur.nect
  cur.next = prev
  prev = cur
  cur = next_node
head = prev

n!/((n-k)!k!)