h2-computing-notes/code/data_structures/queue_list_oop.py at main · LimMengShin/h2-computing-notes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
class Queue:
    def __init__(self):
        self.queue = []

    def enqueue(self, item):
        self.queue.append(item)

    def is_empty(self):
        return self.queue == []

    def dequeue(self):
        if self.is_empty():
            return "queue empty"
        return self.queue.pop(0)

    def display(self):
        print(self.queue)

#main
queue1 = Queue()

#display
queue1.display()

#insert 1 item
queue1.enqueue('a')

#display
queue1.display()

#insert 1 item
queue1.enqueue('b')

#display
queue1.display()

#delete 1 item
print("Deleted: " + queue1.dequeue())

#display
queue1.display()

#delete 2 more items
print("Deleted: " + queue1.dequeue())
print("Deleted: " + queue1.dequeue())

#display
queue1.display()