PriorityQueue implements in Python

PriorityQueue.py

from collections import deque

class PriorityQueueNode(object):
    def __init__(self, id, value):
        self.id = id
        self.value = value

class PriorityQueue(object):
    def __init__(self, k):
        self.q = deque()

    def head(self, i):
        while self.q and self.q[0].id < i:
            self.q.popleft()
        if not self.q: return None
        return self.q[0]

    def append(self, id, value):
        while self.q and self.q[-1].value <= value:
            self.q.pop()
        self.q.append(PriorityQueueNode(id, value))