DataStructures-Algorithms-C/Queue Implementation Using Structure.c at main · mesouvikdev/DataStructures-Algorithms-C · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <stdio.h>

#define MAX 10

/* Queue structure */
struct Queue
{
    int data[MAX];
    int front;
    int rear;
};

/* Function declarations */
void insert(struct Queue *q);
void delete1(struct Queue *q);
void display(struct Queue q);

int main(void)
{
    struct Queue q;
    int choice;

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

    do
    {
        printf("\n\n1. Insert");
        printf("\n2. Delete");
        printf("\n3. Display");
        printf("\n4. Exit");
        printf("\nEnter your choice: ");
        scanf("%d", &choice);

        switch (choice)
        {
            case 1:
                insert(&q);
                break;

            case 2:
                delete1(&q);
                break;

            case 3:
                display(q);
                break;

            case 4:
                printf("Exiting...\n");
                break;

            default:
                printf("Wrong Choice\n");
        }
    } while (choice != 4);

    return 0;
}

void insert(struct Queue *q)
{
    int n;

    if (q->rear == MAX - 1)
    {
        printf("Queue Overflow\n");
    }
    else
    {
        printf("Enter the element: ");
        scanf("%d", &n);
        q->rear++;
        q->data[q->rear] = n;
        printf("%d inserted into queue\n", n);
    }
}

void delete1(struct Queue *q)
{
    int n;

    if (q->rear < q->front)
    {
        printf("Queue is Empty\n");
    }
    else
    {
        n = q->data[q->front];
        q->front++;
        printf("Deleted element is %d\n", n);
    }
}

void display(struct Queue q)
{
    int i;

    if (q.rear < q.front)
    {
        printf("Queue is Empty\n");
    }
    else
    {
        printf("Queue elements are:\n");
        for (i = q.front; i <= q.rear; i++)
        {
            printf("%d\n", q.data[i]);
        }
    }
}