Page 4 - DATA STRUCTURE-STACKS & QUEUES

#QUEUE implementation using LIST

front=-1 #Queue empty
rear=-1 #Queue empty
Que=[]

def isEmpty():
if Que==[]:
return True
else:
return False

def Insert():
x=int(input("Enter the next element: "))
global front
global rear
if front==-1:
front=rear=0
else:
rear=rear+1
Que.append(x)

def Delete():
if isEmpty():
print("Queue is empty")
return
a=Que.pop(0)
global front
global rear
if front==rear:
front=rear=-1
else:
front=0
rear=rear-1
print("Element removed is: ", a)

def Display():
if isEmpty():
print("Queue is empty")
return
print("Queue elements are:\n")
for i in range(front, rear+1):
print(Que[i])

while True:
print("\n\nQueue Operations")
print("1.Insert")
print("2.Delete")