-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueueList.py
48 lines (34 loc) · 984 Bytes
/
queueList.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
# Queue implementation using Py List
# Enqueue and Dequeue TC is O(n), rest is O(1) as well as SC of all
# Several other ways of implementing Queue is possible in Python using:
# collections.deque
# queue module
# multiprocessing.queue
class Queue:
def __init__(self):
self.list = []
def __str__(self):
values = [str(l) for l in self.list]
return ' '.join(values)
def isEmpty(self):
if self.list == []:
return True
else:
return False
# insert/push method
def enqueue(self, value):
self.list.append(value)
return "Element inserted"
# remove/pop method
def dequeue(self):
if self.isEmpty():
return "Queue is empty"
else:
return self.list.pop(0)
def peek(self):
if self.isEmpty():
return "Queue is empty"
else:
return self.list[0]
def delete(self):
self.list = None