Chapter 14, Problem 20E

Program Plan Intro

Rearrangement of queue

Program plan:

• Import necessary packages.
• Create a class “QueueRearrange”,
  • Define the method “interleave ()” that accepts a queue of integers,
    • Check whether the size of the queue is odd,
      • If it is true, throws an exception.
    • Create stack object.
    • Calculate half size of the queue.
    • Execute loop to iterate over half of the queue,
      • Transfer half of the queue elements into the stack.
    • Execute till stack becomes empty,
      • Transfer all the elements from the stack to queue.
    • Execute loop to iterate over half of the queue,
      • Remove and insert the same element into the same queue.
    • Execute loop to iterate over half of the queue,
      • Transfer half of the queue elements into the stack.
    • Execute till stack becomes empty,
      • Transfer all the elements from the stack to queue.
      • Reverse all the elements in the queue.
    • Print the queue after the rearrangement.
  • Define the method “main()”,
    • Construct “LinkedList” object.
    • Add integers into the queue.
    • Print the queue of integers.
    • Call the method “interleave()” with queue as parameter.