How to retrieve elements from sorted TreeSet using Binary Search?

Question

I am trying to merge multiple sorted lists into one TreeSet.. And then I am thinking to apply Binary Search algorithm on that TreeSet to retrieve the element in O(log n) tim

Answer 1

You could use TreeSet.floor(), which according to the docs

Returns the greatest element in this set less than or equal to the given element, or null if there is no such element.