Question

C++ Data Strucutres and Algorithm

Topic: Queues ADT

Write an application level function with the following signature: QueueType joinQueuesSeg (Const QueueType& q1, const QueueType& q2): It should return a new queue containing all q1 items followed by all q2 items sequentially, while leaving q1 and q2 unchanged. For example: If q1 contains {1. 3, 5, 7} and q2 contains {2, 4} the new queue will contain {1, 3, 5, 7, 2, 4}.

Answer 1

#include <iostream>
#include <cstdlib>
#include <queue>

using namespace std;

queue<int> joinQueueSeq(queue<int>& q1,queue<int>& q2){
queue<int> q;
while (!q1.empty()) {
q.push(q1.front());
q1.pop();
}
while (!q2.empty()) {
q.push(q2.front());
q2.pop();
}
return q;
}

int main(void) {
srand(time(0));
queue<int> q1,q2,q;
int i,temp;
for (i = 0; i < 5; ++i){
temp=rand()%10;
cout<<temp<<" ";
q1.push(temp);
}
cout<<endl;
for (i = 0; i < 10; ++i){
temp=rand()%10;
cout<<temp<<" ";
q2.push(temp);
}
cout<<endl;
  
q = joinQueueSeq(q1,q2);

cout << "Contents of resultant queue" << endl;
while (!q.empty()) {
cout << q.front() << " ";
q.pop();
}

return 0;
}