Python|Implementation Of Queue Data Structures

Queue implementation with functions

To maintain number/elements in the form of a Queue

Creation of empty queue

q=[]

Addition of element

def add():
   a=input(“Enter any element “)
   q.append(a)

Deletion of element

def delete():
    if(q==[]):
        print(“Underflow / queus is empty”)
    else:
        print(“poped element is “,q[0])
        q.pop(0)

To check Queue is empty or not

if(q==[]):
   print(“Queue is empty”)
else:
   print(“Queue is not empty”)

Traversal operation

def traverse():
    n=len(q)
    if(n==0):
        print(“queue is empty”)
    else:
        for i in range(0,n):
             print(q[i])

Source Code:

#Queue implementation (using functions)
 q=[]
 def add():
         a=input("Enter any element ")
         q.append(a)
 def delete():
         if(q==[]):
                 print("Underflow /  queus is empty")
         else:
                 print("poped element is ",q[0])
                 q.pop(0)
 def traverse():
         n=len(q)
         if(n==0):
                 print("queue is empty")
         else:
                 for i in range(0,n):
                         print(q[i])
 while True:
         print("1. Insert");
         print("2. Delete");
         print("3. Display All/ Traversal")
         print("4. Exit")
         ch=int(input("Enter your choice "))
         if(ch==1):
                 add()
         elif(ch==2):
                 delete()
         elif(ch==3):
                 traverse()
         elif(ch==4):
                 print("End")
                 break
         else:
                 print("Invalid choice")

Visitor Counter

0056684