Chapter 14, Problem 8E

Program Plan Intro

Palindrome

Program plan:

• Import necessary packages.
• Create a class “QueuePalindrome”,
  • Define the method “rearrange ()” that accepts queue of integers,
    • Construct “Stack” object.
    • Execute till queue size,
      • Assign the element removed from the queue.
      • Insert the element into the queue.
      • Insert the element into the stack.
    • Set the Boolean value to “true”.
    • Execute till queue size,
      • Assign the element removed from the queue to the variable.
      • Assign the element removed from the stack into another variable.
      • Check whether the elements are not equal,
        • If it is true, set the Boolean value to “false”.
        • • Insert the element removed from the queue into the same.
    • Return Boolean value.
  • Define the method “main()”,
    • Create two objects for “LinkedList”.
    • Add integers into the queue.
    • Print the queue of integers.
    • Assign the Boolean value returned from the method “isPalindrome()” when calling with queue as parameter.
    • Check whether the Boolean value is “true”,
      • If it is true, then print the message as Palindrome.
    • Otherwise, print the message as not palindrome.