Chapter 14, Problem 19E

Program Plan Intro

Return and remove the minimum element from the given stack

Program plan:

• Import necessary packages.
• Create a class “StackMin”,
  • Define the method “removeMin ()” that accepts stack of integers,
    • Construct “LinkedList” object.
    • Assign top of stack as minimum element.
    • Insert the minimum element into the queue.
    • Execute till stack becomes empty,
      • Assign the next value removed from the top of stack.
      • Check whether the recently removed value is less than the minimum value,
        • If it is true, assign recently removed value as minimum.
      • Insert recently removed value from the stack into the queue.
    • Execute till queue becomes empty,
      • Assign the element removed from the queue.
      • Check whether the removed value is not equal to minimum,
        • If it is true, insert that value into the stack.
    • Execute till stack becomes empty,
      • Transfer all the elements from stack to queue.
    • Execute till queue becomes empty,
      • Transfer all the elements from queue to stack.
    • Print the stack after being returned the minimum value.
    • Return the minimum value.
  • Define the method “main()”,
    • Construct “Stack” object.
    • Add integers into the stack.
    • Print the stack of integers.
    • Print the minimum value returned from the method “removeMin()” when calling with stack as parameter.