How is the time complexity of TreeSet operations in Java determined?

In Java, TreeSet is implemented based on a red-black tree, which is a balanced binary search tree. Thanks to this, operations such as adding, removing, and searching for an element are performed in O(log n) time, where n is the number of elements in the set.

This means that even with a large number of elements, the operations remain quite fast, as the depth of the tree grows logarithmically.