Please convert the code fromC Language
#include using namespace std;struct Queue {stack s1, s2; // stl used// Enqueue an item to the queuevoid enQueue(int x) {// Push item into the first stacks1.push(x);}// Dequeue an item from the queueint deQueue() {// if both stacks are emptyif (s1.empty() && s2.empty()){cout < "queue="" is="">exit(0);}// if s2 is empty, move elements from s1if (s2.empty()) {while (!s1.empty()) {s2.push(s1.top()); // using stl operation top()s1.pop();}}// return the top item from s2int x = s2.top();s2.pop();return x;}};// main functionint main() {Queue q;int x,count=0;cout<"press 0="" to="" stop="" push="" operaton,="" else="" enqueue="">"press><>cin>>x;while(x){q.enQueue(x);count++;cin>>x;}cout<><>while(count){coutcount--;}cout<"execution>"execution><>return 0;}Output:Extracted text: press 0 to stop push operaton, else enqueue integers 10 20 5 7 dequeueing... 10 20 5 7 execution successful
using namespace std;
struct Queue {
stack s1, s2; // stl used// Enqueue an item to the queuevoid enQueue(int x) {// Push item into the first stacks1.push(x);}// Dequeue an item from the queueint deQueue() {// if both stacks are emptyif (s1.empty() && s2.empty()){cout < "queue="" is="">exit(0);}// if s2 is empty, move elements from s1if (s2.empty()) {while (!s1.empty()) {s2.push(s1.top()); // using stl operation top()s1.pop();}}// return the top item from s2int x = s2.top();s2.pop();return x;}};// main functionint main() {Queue q;int x,count=0;cout<"press 0="" to="" stop="" push="" operaton,="" else="" enqueue="">"press><>cin>>x;while(x){q.enQueue(x);count++;cin>>x;}cout<><>while(count){coutcount--;}cout<"execution>"execution><>return 0;}Output:Extracted text: press 0 to stop push operaton, else enqueue integers 10 20 5 7 dequeueing... 10 20 5 7 execution successful
// Enqueue an item to the queue
void enQueue(int x) {
// Push item into the first stack
s1.push(x);
}
// Dequeue an item from the queue
int deQueue() {
// if both stacks are empty
if (s1.empty() && s2.empty()){
cout < "queue="" is="">
exit(0);
// if s2 is empty, move elements from s1
if (s2.empty()) {
while (!s1.empty()) {
s2.push(s1.top()); // using stl operation top()
s1.pop();
// return the top item from s2
int x = s2.top();
s2.pop();
return x;
};
// main function
int main() {
Queue q;
int x,count=0;
cout<"press 0="" to="" stop="" push="" operaton,="" else="" enqueue="">"press><>
cin>>x;
while(x){
q.enQueue(x);
count++;
cout<><>
while(count){
cout
count--;
cout<"execution>"execution><>
return 0;
Output:
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here