Untitled

Fork

Code

#include <stdio.h>
#define MAX 5

struct queue {
    int a[MAX];
    int front, rear;
};

int main() {
    struct queue q;
    int ch, x, i;

    q.front = -1;
    q.rear = -1;

    while(1) {
        printf("\n1.Insert 2.Delete 3.Display 4.Exit\n");
        printf("Enter choice: ");
        scanf("%d", &ch);

        switch(ch) {
            case 1:
                if(q.rear == MAX-1)
                    printf("Queue Overflow\n");
                else {
                    printf("Enter element: ");
                    scanf("%d", &x);
                    if(q.front == -1)
                        q.front = 0;
                    q.rear++;
                    q.a[q.rear] = x;
                }
                break;

            case 2:
                if(q.front == -1)
                    printf("Queue Underflow\n");
                else {
                    printf("Deleted: %d\n", q.a[q.front]);
                    if(q.front == q.rear)
                        q.front = q.rear = -1;
                    else
                        q.front++;
                }
                break;

            case 3:
                if(q.front == -1)
                    printf("Queue is Empty\n");
                else {
                    printf("Queue: ");
                    for(i=q.front; i<=q.rear; i++)
                        printf("%d ", q.a[i]);
                }
                break;

            case 4:
                return 0;

            default:
                printf("Invalid Choice\n");
        }
    }
}