Java: Get an element in a tree set which is strictly less than the given element
Java Collection, TreeSet Exercises: Exercise-13 with Solution
Write a Java program to get an element in a tree set that has a lower value than the given element.
Sample Solution:
Java Code:
import java.util.TreeSet;
import java.util.Iterator;
public class Exercise13 {
public static void main(String[] args) {
// creating TreeSet
TreeSet <Integer>tree_num = new TreeSet<Integer>();
TreeSet <Integer>treeheadset = new TreeSet<Integer>();
// Add numbers in the tree
tree_num.add(10);
tree_num.add(22);
tree_num.add(36);
tree_num.add(25);
tree_num.add(16);
tree_num.add(70);
tree_num.add(82);
tree_num.add(89);
tree_num.add(14);
System.out.println("Strictly less than 69 : "+tree_num.lower(69));
System.out.println("Strictly less than 12 : "+tree_num.lower(12));
}
}
Sample Output:
Strictly less than 69 : 36 Strictly less than 12 : 10
Flowchart:
Java Code Editor:
Contribute your code and comments through Disqus.
Previous: Get an element in a tree set which is strictly greater than the given element.
Next: Retrieve and remove the first element of a tree set.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://www.w3resource.com/java-exercises/collection/java-collection-tree-set-exercise-13.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics