-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10.queueUsingList.py
46 lines (37 loc) · 982 Bytes
/
10.queueUsingList.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
class Queue:
def __init__(self):
self.front = None
self.rear = None
self.arr = []
def enqueue(self, data):
if self.rear is None:
self.rear = 1
self.front = 1
else:
self.rear += 1
self.arr.append(data)
def dequeue(self):
if self.front is None:
return 'Queue is Empty'
else:
d = self.arr.pop(0)
self.front += 1
if self.front >self.rear:
self.front = None
self.rear = None
return d
def main():
Q1 = Queue()
print('a.enqueue \nb.dequeue \nc.quit')
while 1:
i = input('Enter choice: ')
if i == '1':
n = int(input('Enter Number: '))
Q1.enqueue(n)
elif i == '2':
poped = Q1.dequeue()
print(f'dequeued element is: {poped}')
else:
break
if __name__ == '__main__':
main()