I want to add a new method to the Linked Queue class to combine two queues of...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
I want to add a new method to the Linked Queue class to combine two queues of length n and m together in a new queue and return this new queue. The new queue should contain all elements of the first queue followed by all the elements of the second queue. Thus, the relative order of elements in the input queues and the result queue must be the same after this operation has been completed. What would be the worst-time complexity of this operation?
For example, if I had the following queues:
queue1: 1 -> 2 -> 3 -> 4 -> 5 [1 is the front of the queue]
queue2: 6 -> 7 -> 8 -> 9 -> 10 [6 is the front of the queue]
The resulting queue should be
queue3: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 [1 is the front of the queue]
Note: queue 1 and queue 2 should maintain their original items.
Want instant access to all verified answers on learning.monash.edu?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!