deq main

void main()
{
    queue q;
    int n,ele;
    q.r=q.f=MAX/2;
    while(1)
    {
        printf("\nEnter the operation on queue\n1.\tInsert right\n2.\tInsert left\n3.\tDelete right\n                 scanf("%d",&ele);
                   insertleft(&q,ele);
                   printf("\nQueue after inserting the element\n");
                   display(&q);
            }break;
            case 3:
            {
                if(isempty(&q)==1)
                    printf("\nQueue underflow\n");
                else
                {
                    printf("\nDeleted element is %d\n",deleteright(&q));
                    printf("Queue after deleting element from right is\n");
                    display(&q);
                }
            }break;
            case 4:
            {
                if(isempty(&q)==1)
                    printf("\nQueue underflow\n");
                else
                {
                    printf("\nDeleted element is %d\n",deleteleft(&q));
                    printf("Queue after deleting element from left is\n");
                    display(&q);
                }
            }break;
            case 5:
            {
                if(isempty(&q)==1)
                    printf("\nQueue is empty\n");
                else
                    display(&q);
            }break;
            default:
                printf("\nInvalid choice\n");
        }
    }
}4.\tDelete left\n5.\tDisplay\n6.\tExit\n");
        scanf("%d",&n);
        if(n==6)
            break;
        switch(n)
        {
            case 1:
            {
                printf("Enter the element to be inserted\n")
                scanf("%d",&n);
                insertright(&q,ele);
                printf("Queue after inserting the element is\n");
                display(&q);
            }break;
            case 2:
            {
                   printf("\nEnter the element to be inserted\n");
                   scanf("%d",&ele);
                   insertleft(&q,ele);
                   printf("\nQueue after inserting the element\n");
                   display(&q);
            }break;
            case 3:
            {
                if(isempty(&q)==1)
                    printf("\nQueue underflow\n");
                else
                {
                    printf("\nDeleted element is %d\n",deleteright(&q));
                    printf("Queue after deleting element from right is\n");
                    display(&q);
                }
            }break;
            case 4:
            {
                if(isempty(&q)==1)
                    printf("\nQueue underflow\n");
                else
                {
                    printf("\nDeleted element is %d\n",deleteleft(&q));
                    printf("Queue after deleting element from left is\n");
                    display(&q);
                }
            }break;
            case 5:
            {
                if(isempty(&q)==1)
                    printf("\nQueue is empty\n");
                else
                    display(&q);
            }break;
            default:
                printf("\nInvalid choice\n");
        }
    }
}