QueueImplementationUsingList.md

Queue Implementation using list

Introduction

• You can Implement Queue Using defualt Data Structure list
• Create A simple Class with any Name
• Initialize Queue in Constructor

def_init_(self):
self.queue=[]

• Append Element At the End of Queue

#Add element at rear partdefPut(self,data):
self.queue.append(data)

• Remove element Which is Inserted First

#Remove Element From Front PartdefPop(self):
ifself.queue==[]:
return"Empty Queue"else:
returnself.queue.pop(0)

• Get Rear Element

#Get Last ElementdefGetRear(self):
ifself.queue==[]:
return"Empty Queue"else:
returnself.queue[0]

• Get Front Element

#Get First ELmentdefGetFront(self):
ifself.queue==[]:
return"Empty Queue"else:
returnself.queue[-1]

Example:

#Queue using ListclassQueue:
#Initialize Empty Queuedef__init__(self):
self.queue=[]
#Add element at rear partdefPut(self,data):
self.queue.append(data)
#Remove Element From Front PartdefPop(self):
ifself.queue==[]:
return"Empty Queue"else:
self.queue.pop(0)
#Get First ELmentdefGetFront(self):
ifself.queue==[]:
return"Empty Queue"else:
returnself.queue[-1]
#Get Last ElementdefGetRear(self):
ifself.queue==[]:
return"Empty Queue"else:
returnself.queue[0]
#Initilize Queue Objectq=Queue()
#Insert 6 Into Queueq.Put(6)
print("6 element is Inserted")
#Insert 7q.Put(7)
print("7 element is Inserted")
#Insert 8q.Put(8)
print("8 element is Inserted")
#Print Get Front Elementprint("Element At Front")
print(q.GetFront())
print("Element At Rear")
#Get Last Element print(q.GetRear())
#Pop Last Elementq.Pop()
#Now Print Last Elementprint("After Popping Rear Element")
print(q.GetRear())

output:

6 element is Inserted
7 element is Inserted
8 element is Inserted
Element At Front
8
Element At Rear
6
After Popping Rear Element
7