forked from HarshCasper/NeoAlgo
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Reverse_queue_using_stack.py
43 lines (36 loc) · 997 Bytes
/
Reverse_queue_using_stack.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
"""
A Queue is a linear structure which follows a particular order in which the operations are performed.
The order is First In First Out. The below program reverses a queue using stack data structure.
"""
stack = []
queue = []
def reverse(queue):
while(len(queue)):
stack.append(queue.pop(0))
while(len(stack)):
queue.append(stack.pop())
n = int(input("Enter the elements to insert into queue : "))
print("Enter the elements")
temp = list(map(int,input().split(" ")))
for i in range(n):
queue.append(temp[i])
print("The elements in the queue are ")
for i in range(n):
print(queue[i],end = " ")
print()
print("Elements in queue after reversing using stack")
reverse(queue)
for i in range(n):
print(queue[i],end = " ")
"""
Sample I/O:
Enter the elements to insert into queue : 5
Enter the elements
2 4 3 1 5
The elements in the queue are
2 4 3 1 5
Elements in queue after reversing using stack
5 1 3 4 2
Time complexity : O(n)
Space complexity : O(n)
"""