In [1]:

    

class Node:
    def __init__(self, data = None, next = None):
        self.data = data
        self.next = next


    

In [31]:

    

class PriorityQueue:
    def __init__(self):
        self.items = []
    
    def insert(self, data):
        self.items.append(data)
    
    def remove(self):
        if self.isEmpty():
            return None
        maxi = 0
        for i in range(1,len(self.items)):
            if self.items[maxi] < self.items[i]:
                maxi = i
        result = self.items[maxi]
        self.items[maxi:maxi+1] = []
        return result
        
    def isEmpty(self):
        return self.items == []


    

In [32]:

    

pq = PriorityQueue()
pq.insert("alpha")
pq.insert("beta")
pq.insert("gamma")
pq.insert("delta")
while not pq.isEmpty():
    print(pq.remove())


    

    




gamma
delta
beta
alpha

In [ ]: