Chapter 16, Problem 1PE

Program Plan Intro

A method “reverse()”

Program plan:

• In a file “ListIterator.java”, create an interface “ListIterator”,
  • Declare the method “next()” that moves the iterator past the next element.
  • Declare the method “hasNext()” that check if there is an element after the iterator position.
  • Declare the method “add()”  that adds an element before the position of the iterator and moves the iterator past the added element.
  • Declare the method “remove()” that removes the last traversed element.
  • Declare the method “set()” to set the last traversed element to a previous value.
• In a file “LinkedList.java”, import the package and create a class “LinkedList”,
  • Declare the object variable.
  • Define the constructor to create an empty linked list.
  • Define the method “reverse()”  that reverses the elements in the linked list.
  • Define the method “getFirst()” that returns the first element in the linked list.
  • Define the method “removeFirst()” to remove the first element in the linked list.
  • Define the method “addFirst()” that adds an element to the front of the linked list.
  • Define the method “listIterator()” of type “ListIterator”, that returns an iterator for iterating through the list.
  • Create a class “Node”,
    • Declare the object variable for “Object”, and “Node”.
      • Create a class “LinkedListIterator”,
        • Declare the necessary object variables.
        • Define the constructor to create an iterator that points to the front of the linked list.
        • Define the method “next()”,
        • • If there is no next element then throws an exception.
          • Assign the position to the front of the linked list.
          • Check if position is null, set the first element to the position.
          • Otherwise, set the next position to the current position.
          • Returns the value.
        • Define the method “hasNext()” that check whether there is next element.
        • Define the method “add()”,
        • • If position is null, call the method “addFirst()”.
            • Set the first to the position.
              • Otherwise, create a new node.
                • Assign the element to the new node.
                • Set the next position to the next pointer of the new node.
                • Set the new node value to the next position.
                • Set the new node as the position.
              • Set the position to the previous value.
        • Define the method “remove()”,
        • • Check if there is no next element, throws an exception.
          • If position is same as the first, calls the method “removeFirst()”.
          • Otherwise, set the next position to the previous position.
          • Set the previous to the positions.
        • Define the method “set()”,
        • • If there is no next element, throw an exception.
          • Set the value to the position.
• In a file “ReverseTest.java”, create a class “ReverseTest”,
  • Define the “main()” method.
    • Create “LinkedList” object.
    • Call the method “addFirst()” to add “Tommy” to the font of the linked list.
    • Call the method “addFirst()” to add “Roman” to the font of the linked list.
    • Call the method “addFirst()” to add “Harris” to the font of the linked list.
    • Call the method “addFirst()” to add “David” to the font of the linked list.
    • Call the method “reverse()”.
    • Assign the value returned from the method “listIterator()”.
    • Execute a loop,
      • Print the result returned from the method “next()”.
        • Print the new line.
        • Print the expected result.