TREE MAP IN JAVA || JAVA IN ECLIPSE || MAP INTERAFCE || MUST WATCH смотреть онлайн

METHOD LOCAL INNER CLASS:
https://youtu.be/Y4KMLJv8EL8

JAVA THREAD:
https://youtu.be/ZpKOZfjyZg4

COMPARABLE AND COMPARATOR INTERAFCE :
https://youtu.be/7NhmSHnt92Y

DOWNCASTING :
https://youtu.be/kqPYngG5Ixc

The Map Interface :- A Map is an object that maps keys
to
values. A map cannot contain duplicate keys: Each
key canmap to at most one value. It models the
mathematical function abstraction.
The Java platform contains three
general-purpose Map implementations:
1. HashMap
2. TreeMap
3. LinkedHashMap .
Few characteristics of the Map Interface are:
●A Map cannot contain duplicate keys and
each key can map to at most one value. Some
implementations allow null key and null value like
the HashMap and LinkedHashMap, but some do not
like the TreeMap.
●The order of a map depends on specific imple‐
mentations, e.g TreeMap and LinkedHashMap have
predictable order, while HashMap does not.
●There are two interfaces for implementing
Map in java: Map and SortedMap, and three
classes: HashMap, TreeMap and LinkedHashMap.

TREE MAP IN JAVA :-

Java TreeMap class is a red-black tree based
implementation. It provides an efficient means of
storing key-value pairs in sorted order.

The important points about Java TreeMap class are:
Java TreeMap contains values based on the key. It
implements the NavigableMap interface and extends
AbstractMap class.

Java TreeMap contains only unique elements.

Java TreeMap cannot have a null key but can have
multiple null values.

Java TreeMap is non synchronized.

Java TreeMap maintains ascending order.