Chapter 14, Problem 6E

Program Plan Intro

Rearrange queue of integers

Program plan:

• Import necessary packages.
• Create a class “QueueArrange”,
  • Define the method “rearrange ()” that accepts queue of integers,
    • Construct “Stack” object.
    • Calculate the size of the queue.
    • Execute till queue size,
      • Assign the element removed from the queue.
      • Check whether the element is even,
        • Insert the element into the queue.
      • Otherwise,
        • Insert the element into the stack.
    • Calculate the stack size
    • Execute till stack becomes empty,
      • Insert the element removed from the stack to queue.
    • Execute till the stack size,
      • Insert the element removed from the queue into the same queue.
    • Execute till queue size minus stack size,
      • Insert the element removed from the queue into the stack.
    • Execute till stack becomes empty,
      • Insert the element popped out from the stack to queue.
    • Print the queue of integers after rearranged.
  • Define the method “main()”,
    • Create two objects for “LinkedList”.
    • Add integers into the queue.
    • Print the queue of integers.
    • Call the method “rearrange()” with queue as parameter.