Stack_Queue_Problems/Queue_to_Stack.c at main · NushratJabenAurnima/Stack_Queue_Problems · 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
#include <stdio.h>
#define MAX 20
int q[MAX], s[MAX], f =-1, r =-1, top = -1;
int enq(int);
int deq();
int push(int);
int pop();
void print();

int main()
{
    int val,k,i;
    printf("Input: ");
    for(i=0; i<10 ; i++)
    {
        scanf("%d",&val);
        enq(val);
    }
    printf("Enter key: ");
    scanf("%d",&k);
    for(i=0 ; i<k ; i++)
       push(deq());

    for(i=0 ; i<k ; i++)
       enq(pop());

    printf("Output: ");
    for(i=f; i<=r; i++)
    {
        printf("%d ",q[i]);
    }
    return 0;
}

int enq(int data)
{
    if(r+1 == MAX)
        printf("Queue is full.");
    else if(f == -1 && r == -1)
        {
        f = r = 0;
        q[r] = data;
        return q[r];
        }
        else
        {
            r++;
            q[r] = data;
            return q[r];
        }
}
int push(int data)
{
    if(top+1 == MAX)
        printf("Stack overflow.");
    else
    {
        top++;
        s[top] = data;
        return s[top];
    }
}

int deq()
{
    int data;
    if(f == -1 && r == -1)
        printf("Queue is empty.");
    else if(f == r)
    {
        data = q[f];
        f = r = -1;
        return data;
    }
    else
    {
        data = q[f];
        f++;
        return data;
    }
}

int pop()
{
    int data;
    if(top == -1)
        printf("Stack underflow.");
    else
    {
        data = s[top];
        top--;
        return data;
    }
}
<!DOCTYPE html>
<html>
<body>
<h2>Project Done by &copy; Nushrat Jaben Aurnima. All Rights Reserved .</h2>
</body>
</html>