QEQUE DATA STRUCTURE

MAX_SIZE = 5
queue = MAX_SIZE*[0]
front = 0
rear  = 0



def enqueue(p):
    global rear
    if rear == MAX_SIZE:
        print("overflow")
    else:
        queue[rear] = p
        rear += 1




def dequeue():
    global front,rear
    if front >= rear:
        print("underflow")
    else:
        front += 1

while True:

    print("1 for enqueue ")
    print("2 for dequeue ")
    print("3 for exit")
    choice = int(input())
    if choice == 1:
        n = int(input("enter input: "))
        enqueue(n)
        print(queue[front:rear])
    elif choice == 2:
        dequeue()
        print(queue[front:rear])
    elif choice == 3:
        break
    else:
        print("wrong choice")