-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue using stack
101 lines (97 loc) · 1.85 KB
/
queue using stack
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
#include <stdio.h>
#include<stdlib.h>
#define N 5
int s1[N],s2[N];
int top1=-1,top2=-1;
int count=0;
void enqueue();
void dequeue();
void display();
int main(){
int choice;
while(1){
printf("enter choice 1:enqueue,2:dequeue,3:display,4:exit");
scanf("%d",&choice);
switch(choice){
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
exit(0);
default:
printf("invalid choice");
}
}
}
void push1(int data){
if(top1==-N-1){
printf("unferflow");
}
else{
top1++;
s1[top1]=data;
}
}
void enqueue(){
int x;
if(top1==N-1){
printf("underflow");
}
else{
printf("enter data");
scanf("%d",&x);
push1(x);
count++;
}
}
void dequeue(){
int a,b,i,count,x;
if(top1==-1&&top2==-1){
printf("empty");
}
else{
for(i=0;i<count;i++){
a=pop1();
push2(a);
}
b=pop2();
printf("%d",b);
count--;
for(i=0;i<count;i++){
a=pop2();
push1(a);
}
}
}
int pop1(){
return s1[top1--];
}
int pop2(){
return s2[top2--];
}
void push2(int data){
if(top1==N-1){
printf("empty");
}
else{
top2++;
s2[top2]=data;
}
}
void display(){
int i;
if(top1==-1){
printf("empty");
}
else{
for(i=0;i<=top1;i++){
printf("%d",s1[i]);
}
}
}