-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue_using_stacks.py
More file actions
44 lines (37 loc) · 879 Bytes
/
queue_using_stacks.py
File metadata and controls
44 lines (37 loc) · 879 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
class Queue():
def __init__(self):
self.s1 = []
self.s2 = []
def __str__(self) -> str:
return str(vars(self))
def peek(self):
if len(self.s1) == 0:
print("Queue empty")
else:
return self.s1[len(self.s1)-1]
def enqueue(self, data):
for _ in range(len(self.s1)):
item = self.s1.pop()
self.s2.append(item)
self.s1.append(data)
for _ in range(len(self.s2)):
item = self.s2.pop()
self.s1.append(item)
def dequeue(self):
if len(self.s1) == 0:
print("Queue Empty")
return
else:
return self.s1.pop()
q = Queue()
q.enqueue(2)
q.enqueue(6)
q.enqueue(33)
q.dequeue()
# print(s.pop())
# print(s.pop())
# print(q.pop())
print(q.peek())
# q.dequeue()
# print(q.peek())
print(q)