Deque using Collection Module in DSA Python

Program 1

#implementation of DQueue using collections
import collections
mydq=collections.deque()

# insert Rear function
def insertRear():
    n=int(input("Enter an element"))
    mydq.append(n)
    
# Delete Front function
def deleteFront():
    if(not mydq):
        print("Queue is empty")    
    else:
        print("Delete element is: ",mydq.popleft())        

# insert Front function
def insertFront():
    n=int(input("Enter an element"))
    mydq.appendleft(n)

# Delete Rear function
def deleteRear():
    if(not mydq):
        print("Queue is empty")    
    else:
        print("Delete element is: ",mydq.pop())         

# Display function
def display():
    if(not mydq):
        print("Queue is empty")    
    else:
        print("Elements of Dqueue: ")
        for element in mydq:
            print(element,end=" ")

while(1):
    print("\n---------------------- DQueue Menu--------------------------------\n")
    print("\n 1.Insert Rear \n 2.Delete Front \n 3.Insert Front \n 4. Delete Rear \n 5.Display\n 6.Exit")
    print("\n-----------------------------------------------------------------")
    choice=int(input("Enter your choice"))
    if(choice==1):
        insertRear()
    elif(choice==2):    
        deleteFront()
    elif(choice==3):    
        insertFront()    
    elif(choice==4):    
        deleteFront()        
    elif(choice==5):    
        display()            
    else:
        break;