import ic312.List;

// This fancy generic says that the LinkedList must store elelents whose
// type T is comparable to other elements at type T
//                              |
//                       .______|____________.
//                      /                     \
public class LinkedList<T extends Comparable<T> > implements List<T>{
   //...
}

/**
 * Return the maximum element in the list using compareTo() method
 * of Comparable
 *
 * @return maximum element of the list
 **/
public T max(){
    //TODO: complete this method recursively (maybe need a helper?)
    return null;
}

/**
 * Remove all elements that match e using the equal() operator
 * to determine a match
 *
 * @param e The element that should be removed
 **/
public void remove(T e){
    //TODO: complete this method recursively (maybe need a helper?)
    return;
}

/**
 * Duplicate each element of the list
 *
 * For example, the list [ 0 1 2 ] duplicated becomes [ 0 0 1 1 2 2 ]
 **/
public void duplicate(){
    //TODO: complete this method recursively (maybe need a helper?)
    return;
}

/**
 * Return a string representation of the list with elements in revese order.
 *
 * For example, for a list l of strings with the follwing sequence of operations
 * 
 *  l.add(0,"a");
 *  l.add(1,"b");
 *
 * toString() ->  "[ a b ]"
 * toStringReverse() - >  "[ b a ]"
 *
 * @return the string representation of the items in reverse
 **/
public String toStringReverse(){
    //TODO: complete this method recursively (maybe need a helper?)
    return "";
}