-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueImplUsingArray.py
More file actions
57 lines (42 loc) · 989 Bytes
/
QueueImplUsingArray.py
File metadata and controls
57 lines (42 loc) · 989 Bytes
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
class Queue:
def __init__(self, size):
self.list = [i for i in range(size)]
self.front = -1
self.rear = -1
def enqueue(self, data):
if self.rear == len(self.list) - 1:
return "queue full"
elif self.front == -1 and self.rear == -1:
self.front = self.rear = 0
else:
self.rear = self.rear + 1
self.list[self.rear] = data
return "success"
def dequeue(self):
if self.isEmpty():
return "queue empty"
elif self.front == self.rear:
temp = self.list[self.front]
self.front = -1
self.rear = -1
else:
temp = self.list[self.front]
self.front = self.front + 1
return temp
def frontQ(self):
if self.isEmpty():
return "queue empty"
return self.list[self.front]
def isEmpty(self):
if self.front == -1 and self.rear == -1:
return True
else:
return False
def print(self):
if self.isEmpty():
print("queue empty, nothing to print")
else:
i=0
while i <= self.rear:
print(self.list[i])
i = i + 1