What tree underlies the implementation of the TreeSet data structure?

The implementation of the TreeSet data structure in Java is based on a Red-Black Tree.

This is a balanced binary search tree that provides ordered storage of elements and operations such as insertion, deletion, and search in O(log n) time. Thanks to this, TreeSet maintains elements in sorted order and works efficiently with large data sets.