Question

12. Problem Using only the functions in the queue ADT, wrie an algorithm call ueue P. The function should return the concatenated queue 1T he two queues together. The queue Z should be put at the e queues P and Z, and concatenates t 0 Functions: enqueue(), dequeuer), front(), sizelI. empty) rond dequeurr (Z

I need an answer for problem 12

Answer 1

12.

We are given two queues p and z, we need to concatenate those two into a new queue T, such that z will be after p. The idea start from empty queue T, dequeue each item from p first and enqueue into T, then do the same fro queue z. The detailed method is as follows:

catQueue(p,z):

{

T=new Queue();

while(!empty(p))

{

item=dequeue(p)

enqueue(T,item)

}

while(!empty(z))

{

item=dequeue(z)

enqueue(T,item)

}

}