Chapter 14, Problem 14E

Program Plan Intro

Print queue with first “k” elements reversed

Program plan:

• Import necessary packages.
• Create a class “QueueRevK”,
  • Define the method “reverseFirstK ()” that accepts an integer “k” and queue of integers,
    • Check whether the queue is either null or given integer is greater than the queue size,
      • If it is true, throw an exception.
    • Otherwise, check whether the given integer is greater than “0”,
      • If it is true, create stack object.
      • Execute over first “k” elements,
        • Transfer all the elements from the queue to stack.
        • • Execute over rest of the elements,
            • Insert the element removed from the queue into the same queue.
    • Print the queue after reversing first “k” elements.
  • Define the method “main()”,
    • Construct “LinkedList” object.
    • Add integers into the queue.
    • Print the queue of integers.
    • Call the method “reversefirstK()” with an integer “k” and queue as parameter.