Chapter 14, Problem 7E

Program Plan Intro

Reverse the queue of integers in odd-numbered positions

Program plan:

• Import necessary packages.
• Create a class “QueueRevOdd”,
  • Define the method “rearrange ()” that accepts queue of integers,
    • Construct “Stack” object.
    • Calculate the size of the queue.
    • Execute till queue size,
      • Check whether the position is even,
        • Insert the element removed from the queue into the same queue.
      • Otherwise,
        • Insert the element removed from the queue into the stack.
    • Execute till queue size,
      • Check whether the position is even,
        • Insert the element removed from the queue into the same queue.
      • Otherwise,
        • Insert the element popped out from the stack into the queue.
    • Print the queue of integers after reversed the order of all the elements in the odd-numbered positions.
  • Define the method “main()”,
    • Create two objects for “LinkedList”.
    • Add integers into the queue.
    • Print the queue of integers.
    • Call the method “reverseHalf()” with queue as parameter.