title: Descending ListNode Iterator Implementation
body: <p>My goal in this method is to write the implementation for an iterator that iterates through elements of a listNode in descending order. (From the back to the front) I have attached my implementation of the ascending iterator. Any help in the right direction would be appreciated.   </p>
  
  <pre><code> public MyDescendingDequeIterator(ListNode&lt;E&gt; back, ListNode&lt;E&gt; front) {                    
    frontOfList = front;
    nextToReturn = back;
     while (nextToReturn.next != null) {
      nextToReturn = nextToReturn.next;
  }          
  }
  
  
  public boolean hasNext() {
   if (nextToReturn == null){
   return false;
   } else {
   ListNode&lt;E&gt; current = frontOfList;
   return true;
   }
  }
  
  public E next() {
  ListNode&lt;E&gt; current = frontOfList;
  while ( current.next != nextToReturn ) {
    current = current.next;
  }
  nextToReturn = current;
  
  return nextToReturn.data;
  
  }
  public void remove() {
      throw new UnsupportedOperationException();
  }
  
  }
  </code></pre>