python-data-structures/queue.py at linear-data-structures · Jamalludeen/python-data-structures · 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
49
50
51
52
53
54
55
56
57
58
59
class Queue:
    def __init__(self, size):
        self.get_size = size
        self.queue = []
        self.top = 0

    def enqueue(self, value):
        if len(self.queue) < self.get_size:
            self.queue.append(value)
        else:
            print("Queue is full!")

    def dequeue(self):
        if len(self.queue):
            return self.queue.pop()
        else:
            return "Queue is empty!"

    def rear(self):
        if len(self.queue):
            return self.queue[-1]
        else:
            return "Queue is empty!"

    def front(self):
        if len(self.queue):
            return self.queue[0]
        else:
            return "Queue is empty!"

    def traverse(self):
        if len(self.queue):
            for value in self.queue:
                print(value)
        else:
            print("Queue is empty!")


    def is_empty(self):
        if len(self.queue):
            return False
        else:
            return True


    def get_items(self):
        return f'Queue -> {self.queue}'


if __name__ == '__main__':
    q = Queue(10)
    q.enqueue(1)
    q.enqueue(5)
    q.enqueue(7)
    q.enqueue(10)
    q.enqueue(77)
    q.traverse()
    q.dequeue()
    q.traverse()