Java by API/java.util/TreeSet

new TreeSet(Collection<?> c)

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set.headSet("D"));
   System.out.println(set.tailSet(""));
 }

}

 </source>
   
  
 
  

new TreeSet < E > ()

   <source lang="java">
 

/**

*Output: 
[A, B, C, D, E, F]
*/

import java.util.TreeSet; public class MainClass {

 public static void main(String args[]) {
   TreeSet<String> ts = new TreeSet<String>();
   ts.add("C");
   ts.add("A");
   ts.add("B");
   ts.add("E");
   ts.add("F");
   ts.add("D");
   System.out.println(ts);
 }

}

 </source>
   
  
 
  

new TreeSet < E > (Comparator < ? super)

   <source lang="java">
 

/**

*Output: 
F E D C B A 
 */

import java.util.ruparator; import java.util.TreeSet; class MyComparator implements Comparator<String> {

 public int compare(String a, String b) {
   String aStr, bStr;
   aStr = a;
   bStr = b;
   return bStr.rupareTo(aStr);
 }
 // No need to override equals.

} public class MainClass {

 public static void main(String args[]) {
   TreeSet<String> ts = new TreeSet<String>(new MyComparator());
   ts.add("C");
   ts.add("A");
   ts.add("B");
   ts.add("E");
   ts.add("F");
   ts.add("D");
   for (String element : ts)
     System.out.print(element + " ");
   System.out.println();
 }

}

 </source>
   
  
 
  

TreeSet: add(E o)

   <source lang="java">
 

/**

*Output: 
[A, B, C, D, E, F]
*/

import java.util.TreeSet; public class MainClass {

 public static void main(String args[]) {
   TreeSet<String> ts = new TreeSet<String>();
   ts.add("C");
   ts.add("A");
   ts.add("B");
   ts.add("E");
   ts.add("F");
   ts.add("D");
   System.out.println(ts);
 }

}

 </source>
   
  
 
  

TreeSet: comparator()

   <source lang="java">
 

import java.util.Collections; import java.util.Set; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   Set<String> set = new TreeSet<String>(Collections.reverseOrder());
   for (int i = 0, n = elements.length; i < n; i++) {
     set.add(elements[i]);
   }
   System.out.println(set);
   System.out.println(((TreeSet) set).ruparator());
 }

}

 </source>
   
  
 
  

TreeSet: first()

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set);
   System.out.println(set.first());
   System.out.println(set.last());
 }

}

 </source>
   
  
 
  

TreeSet: headSet(T toElement)

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set.headSet("D"));
   System.out.println(set.tailSet(""));
 }

}

 </source>
   
  
 
  

TreeSet: last()

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set);
   System.out.println(set.first());
   System.out.println(set.last());
 }

}

 </source>
   
  
 
  

TreeSet: remove(Object o)

   <source lang="java">

import java.util.TreeSet; public class Main {

 public static void main(String[] args) {
   TreeSet<Integer> tSet = new TreeSet<Integer>();
   System.out.println("Size of TreeSet : " + tSet.size());
   tSet.add(new Integer("1"));
   tSet.add(new Integer("2"));
   tSet.add(new Integer("3"));
   System.out.println(tSet.size());
   // remove one element from TreeSet using remove method
   tSet.remove(new Integer("1"));
   System.out.println("Size of TreeSet after removal : " + tSet.size());
 }

}

 </source>
   
  
 
  

TreeSet: subSet(T fromElement, T toElement)

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set.subSet("C", "F"));
 }

}

 </source>
   
  
 
  

TreeSet: tailSet(T fromElement)

   <source lang="java">
 

import java.util.Arrays; import java.util.TreeSet; public class Main {

 public static void main(String args[]) throws Exception {
   String elements[] = { "A", "C", "D", "G", "F" };
   TreeSet<String> set = new TreeSet<String>(Arrays.asList(elements));
   System.out.println(set.headSet("D"));
   System.out.println(set.tailSet(""));
 }

}

 </source>