public class SortableLinkedList<T extends Comparable<T>> implements Iterable<T> {
private Node<T> head;
private Comparator<T> comp;
private int listSize;



public SortableLinkedList(Comparator<T> comp) { //creates an empty list with the associated comp
 head = null;
 this.comp = comp;
}


 *  method defines a comparator based on the compareTo method associated
 * with T. You must use "this" to call the previous constructor

public SortableLinkedList() {
 this.comparator = new Comparator<T>(){
  @Override
  public int compare(T o1, T o2) {
   if(o1.compareTo(o2) == 0){
    return 0;
   }else if(o1.compareTo(o2) < 0){
    return -1;
   }else{
    return 1;
   }
  }
 };
}

 * Creates a list based on the elements present in the array list.  You may not use
 * the list iterator to implement this method.

public SortableLinkedList(Comparator<T> comp, ArrayList<T> L) {
 
       ???????????????????????????????????????

}

public SortableLinkedList(Comparator<T> comp, ArrayList<T> L) {
if(L == null){
  head = null;
 }
 int index = 0;
 head = (Node<T>) L.get(0);
 Node<T> curr = head;
 while(index < L.size()){
  curr.next = (Node<T>) L.get(index);
  index++;
 }
 
 while(index < L.size()){
  L.get(index);
 }
}

this(comp);
head = list.get(0);
node = head;
for i = 1 to n{
  node.next = list.get(i);
  node = node.next;
}