-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathqueueArray.cpp
More file actions
49 lines (42 loc) · 850 Bytes
/
Copy pathqueueArray.cpp
File metadata and controls
49 lines (42 loc) · 850 Bytes
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
#include<bits/stdc++.h>
using namespace std;
stack<int> s1, s2;
void insert(int x){
while(!(s1.empty())){
s2.push(s1.top());
s1.pop();
}
s1.push(x);
while (!(s2.empty())) {
s1.push(s2.top());
s2.pop();
}
}
void print(int n){
if(s1.empty()){
return;
}
for(int i=0; i<n; i++){
cout << s1.top() << " ";
s1.pop();
}
}
int main(){
int n;
int elements;
cin >> n;
if(n<=0){
cout << "Queue is empty";
return 0;
}else{
for(int i=0; i<n; i++){
cin >> elements;
insert(elements);
}
cout << "Enter the size of stack:" << endl;
cout << "Enter the stack values:" << endl;
cout << "Queue elements are:" << endl;
print(n);
}
return 0;
}