title: Time complexity of TreeMap operations- subMap, headMap, tailMap
body: <p>Does anyone know the time complexity of the operations of TreeMap like - subMap, headMap. tailMap.</p>
  
  <p>The time complexity of operations like get, put is O(logn).
  But the javadoc doesnt say much about the complexity for the above operations.</p>
  
  <p>The worst case complexity I can thinks of O(n) since it will go through the entire list if the    set includes the last element.
  Can we confirm it?</p>