What is TreeSet in Java?

A TreeSet in Java is a part of the Java Collections Framework that implements the Set interface. It is a collection that stores elements in a sorted (natural order or a specified comparator) manner. TreeSet is backed by a Red-Black tree, which is a self-balancing binary search tree, ensuring that the set remains sorted. Because of its nature, TreeSet does not allow duplicate elements, and the elements must be mutually comparable.

Key Features of TreeSet:

  • Sorted order of elements
  • No duplicates allowed
  • Faster operations for sorted data, i.e., O(log n) time complexity for add, remove, and contains operations

Example Code:

import java.util.TreeSet; public class TreeSetExample { public static void main(String[] args) { TreeSet<String> treeSet = new TreeSet<>(); treeSet.add("Apple"); treeSet.add("Banana"); treeSet.add("Orange"); treeSet.add("Grapes"); System.out.println("TreeSet: " + treeSet); } }

TreeSet Java collections framework sorted set Red-Black tree elements unique comparator

Related Questions

How do I avoid rehashing overhead with std::set in multithreaded code?

How do I find elements with custom comparators with std::set for embedded targets?

How do I erase elements while iterating with std::set for embedded targets?

How do I provide stable iteration order with std::unordered_map for large datasets?

How do I reserve capacity ahead of time with std::unordered_map for large datasets?

How do I erase elements while iterating with std::unordered_map in multithreaded code?

How do I provide stable iteration order with std::map for embedded targets?

How do I provide stable iteration order with std::map in multithreaded code?

How do I avoid rehashing overhead with std::map in performance-sensitive code?

How do I merge two containers efficiently with std::map for embedded targets?