TreeMap is a Red-Black tree based NavigableMap implementation.

Important properties of TreeMap

1. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time.

2. 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.

SortedMap interface extends Map interface to further provide a total ordering on its keys.

Important Properties of SortedMap

• SortedMap is ordered according to the natural ordering of its keys, or by a Comparator typically provided at sorted map creation time.

• Order is reflected when iterating over the sorted map's collection views returned by the entrySet, keySet and values methods.

• SortedMap is the map analogue of SortedSet.

Map is an object that maps keys to values.

Important properties of a Map

1. A map cannot contain duplicate keys

2. Each key can map to at most one value.

3. Map interface takes the place of the abstract Dictionary class.

4. The order of a map is the order in which the iterators on the map's collection views return their elements.

List is an ordered collection.

Important points about List interface

1. also known as a sequence.

2. typically allow duplicate

   • typically allow multiple null elements if they allow null elements at all.

3. Places additional stipulations on the contracts of the iterator, add, remove, equals, and hashCode methods.

Collection Interface is the Root interface in the collection hierarchy.

Important properties Collection interface

1. JDK does not provide any direct implementations of this interface: it provides implementations of more specific subinterfaces like Set and List etc.