
- Java.util Package Classes
- Java.util - Home
- Java.util - ArrayDeque
- Java.util - ArrayList
- Java.util - Arrays
- Java.util - BitSet
- Java.util - Calendar
- Java.util - Collections
- Java.util - Currency
- Java.util - Date
- Java.util - Dictionary
- Java.util - EnumMap
- Java.util - EnumSet
- Java.util - Formatter
- Java.util - GregorianCalendar
- Java.util - HashMap
- Java.util - HashSet
- Java.util - Hashtable
- Java.util - IdentityHashMap
- Java.util - LinkedHashMap
- Java.util - LinkedHashSet
- Java.util - LinkedList
- Java.util - ListResourceBundle
- Java.util - Locale
- Java.util - Observable
- Java.util - PriorityQueue
- Java.util - Properties
- Java.util - PropertyPermission
- Java.util - PropertyResourceBundle
- Java.util - Random
- Java.util - ResourceBundle
- Java.util - ResourceBundle.Control
- Java.util - Scanner
- Java.util - ServiceLoader
- Java.util - SimpleTimeZone
- Java.util - Stack
- Java.util - StringTokenizer
- Java.util - Timer
- Java.util - TimerTask
- Java.util - TimeZone
- Java.util - TreeMap
- Java.util - TreeSet
- Java.util - UUID
- Java.util - Vector
- Java.util - WeakHashMap
- Java.util Package Extras
- Java.util - Interfaces
- Java.util - Exceptions
- Java.util - Enumerations
- Java.util Useful Resources
- Java.util - Useful Resources
- Java.util - Discussion
java.util.TreeSet.iterator() Method
Description
The iterator() method is used to return an iterator over the elements in this set in ascending order.
Declaration
Following is the declaration for java.util.TreeSet.iterator() method.
public Iterator<E> iterator()
Parameters
NA
Return Value
The method call returns an iterator over the elements in this set in ascending order.
Exception
NA
Example
The following example shows the usage of java.util.TreeSet.iterator() method.
package com.tutorialspoint; import java.util.Iterator; import java.util.TreeSet; public class TreeSetDemo { public static void main(String[] args) { // creating a TreeSet TreeSet <Integer>treeadd = new TreeSet<Integer>(); // adding in the tree set treeadd.add(1); treeadd.add(13); treeadd.add(17); treeadd.add(2); // create ascending iterator Iterator iterator; iterator = treeadd.iterator(); // displaying the Tree set data System.out.println("Tree set data in ascending order: "); while (iterator.hasNext()) { System.out.println(iterator.next() + " "); } } }
Let us compile and run the above program, this will produce the following result.
Tree set data in ascending order: 1 2 13 17
java_util_treeset.htm
Advertisements