forked from OmkarPathak/Data-Structures-using-Python
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCicularQueue.py
55 lines (48 loc) · 1.34 KB
/
CicularQueue.py
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
# Author: OMKAR PATHAK
class CircularQueue(object):
def __init__(self, limit = 10):
self.front = None
self.rear = None
self.limit = limit
self.queue = []
# for printing the queue
def __str__(self):
return ' '.join([str(i) for i in self.queue])
# for checking if queue is empty
def isEmpty(self):
return self.queue == []
# for checking if the queue is full
def isFull(self):
return len(self.queue) == self.limit
# for adding an element at the rear end
def enqueue(self, data):
if self.isFull():
print('Queue is Full!')
elif self.isEmpty():
self.front = self.rear = 0
self.queue.append(data)
else:
self.rear += 1
self.queue.append(data)
# for deleting the deleting an element from front end
def dequeue(self):
if self.isEmpty():
print('Queue is Empty!')
else:
self.front += 1
return self.queue.pop(0)
if __name__ == '__main__':
myCQ = CircularQueue(5)
myCQ.enqueue(14)
myCQ.enqueue(22)
myCQ.enqueue(13)
myCQ.enqueue(16)
print('Queue:',myCQ)
myCQ.dequeue()
myCQ.dequeue()
print('Queue:',myCQ)
myCQ.enqueue(9)
myCQ.enqueue(20)
myCQ.enqueue(5)
myCQ.enqueue(5)
print('Queue:',myCQ)