Untitled

Conclusion
Use a TreeSet when:

You need to dynamically maintain a sorted order of elements.
You need efficient range-based or closest-value queries.

log(n) tc for add(),remove(),celing(),floor(),lower(),higher()

When Not to Use TreeSet
Small Input Size:

The overhead of maintaining a TreeSet is unnecessary for small arrays. Simpler solutions may work better.

Constant Time Requirements:
If you need O(1) operations like accessing the maximum or minimum element, a TreeSet is less optimal compared to a data structure like a Heap.
When Memory is a Concern:

A TreeSet has a higher memory overhead due to the internal structure of the red-black tree.

Use Case in Problems
These functions are useful in problems where:

You need to find the closest elements to a given value.
Efficient range queries are required, such as finding bounds or intervals dynamically.

For example, in a prefix sum problem:

floor() and ceiling() can help find bounds.
higher() and lower() can help find strictly greater or smaller values.