@@ -0,0 +1,1250 @@
+package collections;%0A%0Aimport java.util.TreeSet;%0A%0A/**%0A * - TreeSet%0A * it has unique and sorted elements in natural order%0A * String values are ordered according to their ASCII code. Increasing order 0-9 ... A-Z ...a-z%0A * %0A * - Constructors%0A * TreeSet()%0A * TreeSet(Comparator)%0A * TreeSet(Collection)%0A * %0A * - Some methods%0A * E ceiling(E) - returns least element which is greater than or equal to given value %0A * E floor(E) - returns highest element which is less than or equal to given value%0A * E higher(E) - returns least element which is greater than given value%0A * E lower(E) - returns highest element which is less than given value%0A * %0A */%0Apublic class AboutTreeSet %7B%0A%0A%09public static void main(String%5B%5D args) %7B%0A%09%09TreeSet%3CString%3E treeSet = new TreeSet%3CString%3E();%0A%09%09treeSet.add(%22Two%22);%0A%09%09treeSet.add(%22two%22);%0A%09%09treeSet.add(%22TWO%22);%0A%09%09treeSet.add(%221%22);%0A%09%09treeSet.add(%222%22);%0A%09%09%0A%09%09System.out.println(treeSet);%09// %5B1, 2, TWO, Two, two%5D%0A%09%09%0A%09%09System.out.println(treeSet.ceiling(%22TWO%22));%09%09// TWO%0A%09%09System.out.println(treeSet.floor(%22TWO%22));%09%09// TWO%0A%0A%09%09System.out.println(treeSet.ceiling(%223%22));%09%09// TWO%0A%09%09System.out.println(treeSet.floor(%223%22));%09%09%09// 2%0A%09%09%0A%09%09System.out.println(treeSet.higher(%22TWO%22));%09%09// Two%0A%09%09System.out.println(treeSet.lower(%22TWO%22));%09%09// 2%0A%09%7D%0A%7D%0A

Create AboutTreeSet.java