Help with TreeSet and finding longest string

Well due to sickness I missed a week of college which means I missed out on a lecture Im using something called TreeSet which seems to group things. Anywho I need to get the longest name in a list of names. Here is my code:
Code:
import java.util.*;
/** demonstrates Set and SortedSet via a list of names
*/
public class NameSet {
public static void main (String args[]){
Set<String> names = new HashSet<String>();
names.add("Bernadine");
names.add("Elizabeth");
names.add("Gene");
names.add("Elizabeth");
names.add("Clara");
System.out.println(names);
// transfer all the names to a (sorted) TreeSet
TreeSet<String> sortedNames = new TreeSet<String>(names);
System.out.println(sortedNames);
System.out.println("First person is " +sortedNames.first());
System.out.println("longest name is ")+sortedNames.
}
}
Code end.
Ps Im not being lazy I just want a straightforward answer as I dont get it

hey, for what i understood a treeset does the organising of the elements you add to it automatic, using a comparator,
this is a certain value to what you compare every imputed element. this comparator can be static or resizeable.
witch you can define your self or use a default one.

knowing that the longest inputted string will always be the last or first of the set (not sure witch it is). i haven't tested this tho.

I do suggest however you readup upon the subject cause its quite complex matter imo.

for more on the tree set
TreeSet (Java 2 Platform SE v1.4.2)
and for more on the comparator
Comparator (Java 2 Platform SE v1.4.2)

Thanks its something at least. I already checked the api but thanks anyway

As mentioned, see the API - a TreeSet will order entries based upon their natural ordering or a provided Comparator. This means for String's (without a defined comparator) they will be alphabetized (see String.compareTo in the API docs). To retrieve the elements of the Set, retrieve the Iterator of that set and do the Iteration.
The Set Interface (The Java™ Tutorials > Collections > Interfaces)