TreeMap - Search Time Complexity
-
30-09-2019 - |
Question
What is the time complexity of a get() and put() in a TreeMap?
Is the implementation same as a Red-Black Tree?
Solution
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
OTHER TIPS
TreeMap is:
A Red-Black tree based NavigableMap implementation.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to Algorithms.
Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow