-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueue.py
48 lines (36 loc) · 955 Bytes
/
Queue.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
'''
Author: Sai Uday Bhaskar Mudivarty
Program: Queues
'''
class Queue:
def __init__(self):
self.items = list()
def enqueue(self,data):
self.items.insert(0,data)
def dequeue(self):
return self.items.pop()
def isEmpty(self):
return len(self.items) == 0
def __len__(self):
return len(self.items)
def size(self):
return len(self.items)
def front(self):
return self.items[len(self.items)-1]
def __str__(self):
returnstring="Queue follows: \n"
for element in self.items:
returnstring += str(element)+"\n"
return returnstring
if __name__ == "__main__":
queue = Queue()
queue.enqueue(1)
queue.enqueue(5)
queue.enqueue(10)
print(queue.front())
print(queue.dequeue())
print(queue.size())
print(queue.front())
print(queue.size())
print(queue.isEmpty())
print(queue)