TreeMap - Search Time Complexity

Question

What is the time complexity of a get() and put() in a TreeMap?

Is the implementation same as a Red-Black Tree?

Answer 1

From here: http://java.sun.com/javase/6/docs/api/java/util/TreeMap.html

This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations