Chapter 14, Problem 16E

Program Plan Intro

Print mirrored version of given stack

Program plan:

• Import necessary packages.
• Create a class “MirroredStack”,
  • Define the method “mirror ()” that accepts stack of integers,
    • Check whether the stack contains “null”,
      • If it is true, return throws an exception.
    • Construct “LinkedList” object.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Execute over queue elements,
      • Assign the element removed from the queue.
      • Insert that element into the queue.
      • Insert the same element into the stack.
    • Calculate the queue size.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Execute over queue elements,
      • Remove and insert the same element into the queue.
    • Execute till queue becomes empty,
      • Transfer all the elements from queue to stack.
    • Print the mirrored version of the stack.
  • Define the method “main()”,
    • Construct “Stack” object.
    • Add integers into the stack.
    • Print the stack of integers.
    • Call the method “mirror()”with stack as parameter.