TreeMap - Search Time Complexity
-
30-09-2019 - |
Pergunta
What is the time complexity of a get() and put() in a TreeMap?
Is the implementation same as a Red-Black Tree?
Solução
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
Outras dicas
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.
Licenciado em: CC-BY-SA com atribuição
Não afiliado a StackOverflow