TreeSet Class : TreeSet « Collections « Java Tutorial

  1. The other concrete Set implementation is the TreeSet.
  2. A TreeSet keeps its elements ordered internally.
  3. The tree is balanced, it's a red-black tree.
  4. Having a balanced tree guarantees a quick o(log n) search time at the cost of a more time-intensive insertion (and deletion).
  5. Elements added to the tree must be orderable.

Red-black tree rules refresher:

  1. Every node in the tree is either black or red.
  2. The root is always black.
  3. If a node is red, its children must be black.
  4. Every path from the root to a leaf (or null child) must contain the same number of black nodes. (referenced from "Java Collections by John Zukowski Apress 2001")

9.22.1.TreeSet Class
9.22.2.Creating a TreeSet
9.22.3.Get Synchronized Set from TreeSet
9.22.4.Copy all elements in TreeSet to an Object Array
9.22.5.Get Head Set from Java TreeSet
9.22.6.Get lowest and highest value stored in TreeSet
9.22.7.Get Size of TreeSet
9.22.8.Get Sub Set from TreeSet
9.22.9.Get Tail Set from TreeSet
9.22.10.Iterate through elements of TreeSet
9.22.11.Check if a particular value exists in TreeSet
9.22.12.Remove specified element from TreeSet
9.22.13.Remove all elements from TreeSet
9.22.14.The second two constructors are copy constructors
9.22.15.Sort items in a Set
9.22.16.To add a single element: the add() method: public boolean add(Object element)
9.22.17.Retrieving the Ends for a TreeSet
9.22.18.Fetching Elements: the iterator() method: public Iterator iterator()
9.22.19.Working with Subsets
9.22.20.The third method subSet() provides the end points: public SortedSet subSet(Object fromElement, Object toElement)
9.22.21.headset, tailset and subset
9.22.22.Viewing Subsets
9.22.23.Looping through a sorted set backwards