TreeMap - Search Time Complexity?

From here: java.sun.com/javase/6/docs/api/java/util... This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations.

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.

It’s all there, you know. And in the first two paragraphs of the summary, no less.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.