Question: myqueue; n1 = 4; n2 = 8; n3 = n1 + 1; myqueue.enqueue(n2); myqueue.enqueue(n2 + 1); myqueue.enqueue(n1); n2=myqueue.dequeue(); n1 = n2 + 1; myqueue.enqueue(n1); myqueue.enqueue(n3);
myqueue; n1 = 4; n2 = 8; n3 = n1 + 1; myqueue.enqueue(n2); myqueue.enqueue(n2 + 1); myqueue.enqueue(n1); n2=myqueue.dequeue(); n1 = n2 + 1; myqueue.enqueue(n1); myqueue.enqueue(n3); while (!myqueue.isEmpty()) { n3=myqueue.dequeue(); cout << n3 << endl; } cout << n1 << endl << n2 << endl << n3 << endl;
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
