Data-Structure-and-Algorithm-using-C/queue using stack.c at main · Ajax07/Data-Structure-and-Algorithm-using-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
112
113
114
115
116
117
118
119
120
121
122
123
#include <stdio.h>
#include <stdlib.h>

void push1(int);
void push2(int);
int pop1();
int pop2();
void queue();
void enqueue();
void dequeue();

int st1[100], st2[100];
int top1 = -1;
int top2 = -1;
int count = 0;

void main()
{
    int x,a=0;

    printf("\n Enqeue data into Queue");
    printf("\n Dequeue data from Queue");
    queue();
    while(1)
    {
        printf("\n enter choice");
        scanf("%d",&x);
        switch(x)
        {

            case 1:
                enqueue();
            break;
            case 2:
                dequeue();
            break;
            case 3:
                print();
            break;
            case 4:
                exit(0);

            default:
                printf("error");
        }
    }
}
void queue()
{
    top1 = top2 =-1;
}

void push1(int data)
{
//    top1++;
    st1[++top1] = data;
}

int pop1()
{
    return(st1[top1--]);
//    --top1;
}

void push2(int data)
{
//    top2++;
    st2[++top2] = data;
}

int pop2()
{
    return(st2[top2--]);
//    --top2;
}

void enqueue()

{
    int data, i;

    printf("\n enter the data");
    scanf("%d",&data);
    push1(data);
    count++;
}

void dequeue()
{
    int i;

    for(i=0;i<=count;i++)
    {
        push2(pop1());

    }
    pop2();
    count--;
    for (i=0;i<=count;i++)
    {
        push1(pop2());
    }
}

void print()
{
    int i;
    for (i=0; i<= top1;i++)
    {
        printf(" %d ",st1[i]);
    }
//    printf("\n stack2");
//    for (i=0; i<= top2;i++)
//    {
//        printf("%d",st2[i]);
 //   }
}