TreeMap - Search Time Complexity

java search insert time-complexity treemap
java_geek picture java_geek · May 19, 2010 · Viewed 24.5k times · Source

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

Is the implementation same as a Red-Black Tree?

Answer

Daniel Renshaw picture Daniel Renshaw · May 19, 2010

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

Related questions

How to find the index of an element in an int array?

How can I find an index of a certain value in a Java array of type int? I tried using Arrays.binarySearch on my unsorted array, it only sometimes gives the correct answer.

Read More
Java List.contains(Object with field value equal to x)

I want to check whether a List contains an object that has a field with a certain value. Now, I could use a loop to go through and check, but I was curious if there was anything more code efficient. …

Read More
Searching in a ArrayList with custom objects for certain strings

I have a ArrayList with custom objects. I want to search inside this ArrayList for Strings. The class for the objects look like this: public class Datapoint implements Serializable { private String stateBased; private String name; private String priority; private String …

Read More