forked from codemistic/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.py
More file actions
64 lines (44 loc) · 1.18 KB
/
queue.py
File metadata and controls
64 lines (44 loc) · 1.18 KB
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
60
61
62
63
64
# creation of queue
from calendar import c
class Queue:
def __init__(self):
self.items =[]
def __str__(self):
values=[str(x) for x in self.items]
return ' '.join(values)
# if the queue is empty
def isEmpty(self):
if self.items==[]:
return True
else:
return False
#to insert elements in a queue
def Enqueue(self,value):
self.items.append(value)
return "element added successfully"
# to remove element
def Dequeue(self):
if self.isEmpty():
return "there is no element in queue"
else:
return self.items.pop(0)
# peek()
def peek(self):
if self.isEmpty():
return "no element in queue"
else:
return self.items[0]
#delete entire queue
def delete(self):
self.items =None
customQueue = Queue()
print(customQueue.isEmpty())
customQueue.Enqueue(1)
customQueue.Enqueue(2)
customQueue.Enqueue(3)
customQueue.Enqueue(4)
print(customQueue)
customQueue.Dequeue()
print(customQueue)
customQueue.delete()
print(customQueue)