Searching...
Saturday, 6 October 2012

Java Collections: TreeSet Example

06:35
·         Stores the elements in a balanced binary tree
·         A binary tree is a tree in which each node has at most two children
·         TreeSet elements are ordered
·         Less efficient than HashSet in insertion due to the use of a binary tree
·         Its methods are not synchronized
 
image
 

Example

package mycollectiontest;

import java.util.Iterator;
import java.util.Set;
import java.util.TreeSet;

public class CollectionExample {

public static void main(String[] args) {
Set<String> tset = new TreeSet<String>();

// Adding objects
tset.add("Java");
tset.add("PHP");
tset.add("Jboss");
tset.add(".Net");
tset.add("Oracle");

System.out.println("treeset values = " + tset);

Iterator<String> i = tset.iterator();
while (i.hasNext()) {
System.out.println("Elements " + i.next());
}

}

}

Output

treeset values = [.Net, Java, Jboss, Oracle, PHP]
Elements .Net
Elements Java
Elements Jboss
Elements Oracle
Elements PHP

0 comments: