title: Computational Complexity of TreeSet methods in Java
body: <p>Is the computational complexity of TreeSet methods in Java, same as that of an AVLTree? </p>
  
  <p>Specifically, I want to know the computational complexity of the following methods:
  1.add
  2.remove
  3.first
  4.last
  5. floor
  6. higher</p>
  
  <p>Java Doc for method description: <a href="http://docs.oracle.com/javase/6/docs/api/java/util/TreeSet.html" rel="noreferrer">http://docs.oracle.com/javase/6/docs/api/java/util/TreeSet.html</a></p>
  
  <p>For an AVL Tree, there are all O(logn)? Whats the complexity of the above TreeSet Methods?</p>