Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
27 lines (22 loc) · 854 Bytes

File metadata and controls

27 lines (22 loc) · 854 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
import java.util.TreeSet;
public class TreeSetDemo {
public static void main(String[] args) {
TreeSet t=new TreeSet();
//Elements are inserted according to default natural sorting Order
// "a"(97) > "A" (65)
/**
* while adding null in "non empty" tree set we need to compare null with other elements so it is
* null pointer exception
* but we can add null in "empty tree set" at 1st insertion no need to compare null with any another
* element
*/
t.add(null);// null insetion possible only once
t.add("A");
t.add("a");
t.add("B");
t.add("Z");
t.add("c");
// t.add(new Integer(90));//Heterogenous insetion not possible so error
System.out.println(t);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.