importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Mango");ts.add("Grapes");ts.add("Cherry");ts.add("Apple");System.out.println(ts);System.out.println("Size: "+ts.size());}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Mango");ts.add("Grapes");ts.add("Cherry");ts.add("Apple");System.out.println(ts);System.out.println(ts.first());System.out.println(ts.last());}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Mango");ts.add("Pineapple");ts.add("Grapes");ts.add("Cherry");ts.add("Apple");System.out.println(ts);System.out.println(ts.higher("Orange"));System.out.println(ts.lower("Orange"));}}
Java TreeSet: headSet(), subSet() and tailSet() methods
KW.java
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Mango");ts.add("Pineapple");ts.add("Grapes");ts.add("Cherry");ts.add("Apple");System.out.println(ts);System.out.println(ts.headSet("Grapes"));System.out.println(ts.subSet("Apple","Mango"));System.out.println(ts.tailSet("Grapes"));}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<Float>ts=newTreeSet<>();ts.add(2455.336F);ts.add(36985.336F);ts.add(1256.39F);ts.add(987442.933F);ts.add(45.73F);ts.add(47.99F);ts.add(1.20220F);ts.add(12255.00F);System.out.println(ts);System.out.println(ts.ceiling(2500F));//return least element from the set which is greater than or equal to the given elementSystem.out.println(ts.floor(100F));//return greatest element from the set which is less than the given element}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Blueberry");ts.add("Mango");ts.add("Grapes");ts.add("Apple");ts.add("Bananas");System.out.println(ts);System.out.println(ts.ceiling("Dates"));System.out.println(ts.floor("Cherry"));}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Blueberry");ts.add("Mango");ts.add("Pineapple");ts.add("Grapes");ts.add("Apple");ts.add("Bananas");System.out.println(ts);ts.pollFirst();ts.pollLast();System.out.println(ts);}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts1=newTreeSet<>();ts1.add("Apple");ts1.add("Orange");ts1.add("Mango");ts1.add("Blueberry");System.out.println(ts1);TreeSet<String>ts2=newTreeSet<>();ts2.add("Apple");ts2.add("Orange");ts2.add("Mango");ts2.add("Pineapple");ts1.addAll(ts2);System.out.println(ts1);System.out.println(ts1.contains("Pineapple"));System.out.println(ts2.containsAll(ts1));}}
importjava.util.TreeSet;classKW{publicstaticvoidmain(String[]args){//TreeSet class implements the NavigableSet -> SortedSet -> Set interfaceTreeSet<String>ts=newTreeSet<>();ts.add("Apple");ts.add("Orange");ts.add("Mango");ts.add("Grapes");ts.add("Cherry");ts.add("Apple");ts.remove("Apple");System.out.println(ts);ts.removeAll(ts);//ts.clear();System.out.println("Size: "+ts.size());System.out.println(ts.isEmpty());}}
Dear User, Thank you for visitng KodingWindow. If you are interested in technical articles, latest technologies, and our journey further, please follow us on LinkedIn.
Dear User, We are grateful for your interest in the KodingWindow Android app. We intend to soon make it available on the Google Play Store. Currently, you need to install apk manually. Would you like to get the app? Minimum Requirement(s): Android 10