-
Notifications
You must be signed in to change notification settings - Fork 0
/
ts.java
40 lines (38 loc) · 1.25 KB
/
ts.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import java.util.*;
public class ts {
public static void main(String[] args) {
TreeSet<Integer> ts = new TreeSet<Integer>();
ts.add(10);
ts.add(2);
ts.add(5);
ts.add(8);
ts.add(100);
ts.add(20);
ts.add(45);
System.out.println("Output :");
for (Integer ele : ts) {
System.out.print(ele + " ");
}
//Closer or Greater
System.out.println("\n"+ts.ceiling(5));
//Greater
System.out.println("\n"+ts.higher(5));
//Closer or least
System.out.println("\n"+ts.floor(5));
//HeadSet
TreeSet<Integer> head = new TreeSet<Integer>();
head = (TreeSet<Integer>)ts.headSet(34);
System.out.println("HeadSet : "+head);
//TailSet
TreeSet<Integer> tail = new TreeSet<Integer>();
tail = (TreeSet<Integer>)ts.tailSet(34);
System.out.println("TailSet : "+tail);
System.out.println("Highest Number : "+ts.last());
System.out.println("Lowest Number : "+ts.first());
ts.remove(ts.first());
ts.remove(ts.last());
System.out.print("After Removing : ");
System.out.println(ts);
System.out.println("Size: "+ts.size());
}
}