title: What is the time complexity of lower()/higher() of TreeSet in Java?
body: <p>I know the time complexity of basic operations such as add, get is O(logn). But I didn't found the detail of lower() and higher(). So, what is the time complexity of lower() and higher() of TreeSet in Java?</p>