Chapter 14, Problem 18E

Program Plan Intro

Print each half of the queue with its mirrored version

Program plan:

• Import necessary packages.
• Create a class “QueueHalfMirror”,
  • Define the method “mirrorHalves ()” that accepts a queue of integers,
    • Check whether the queue is null or the size of the queue is odd,
      • If it is true, throws an exception.
    • Create stack object.
    • Calculate queue size.
    • Execute over half of the queue,
      • Assign first element removed from the queue to the variable.
      • Insert that element into the stack.
      • Insert that same element into the queue.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Execute over half of the queue,
      • Assign first element removed from the queue to the variable.
      • Insert that element into the stack.
      • Insert that same element into the queue.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Print each half of the queue with its mirrored version.
  • Define the method “main()”,
    • Construct “LinkedList” object.
    • Add integers into the queue.
    • Print the queue of integers.
    • Call the method “mirrorHalves()” with queue as parameter.