we can accomplish similar task with Set and

import java.io.*;
import java.util.List;
import java.util.*;// Arrays.sort
import java.util.ArrayList;
import java.util.Stack;
//import java.util.Queue.*;// Queue
public class Test_This {
public static void main(String[] args) throws IOException{
// TODO Auto-generated method stub
Process p1 = new Process();
p1.method_1();
}
}
class Process
{
String[] first = {"Java","A+","C#","XML","JSP","PHP","Z", "C#"};

public Process()
{
System.out.println("Default) constructor");
}
public void method_1()
{
//List list = Arrays.asList(first);
//adding values to List collection
List<String> list = new ArrayList<String>();
TreeSet list1 = new TreeSet();
List list2 = new ArrayList();
Set set2 = new HashSet(list2);
System.out.println("--adding arrays as heap in a collection----");
//for(int i = 0; i < first.length; i++)
for (String a : first)
{
list.add(a);
set2.add(a);
}
System.out.println("List : " +list);
System.out.println("Set Has set : " +set2);
System.out.println("Collection.min(list) : " + Collections.min(list));
System.out.println("Collections.max(list): " + Collections.max(list));
System.out.println(" Reverse order");
System.out.println("\t Collections.min(list): " + Collections.min(list,(Collections.reverseOrder())));
System.out.println("\t Collections.max(list): " + Collections.max(list,(Collections.reverseOrder())));

}
}