java datastructures net the map abstract data type map allows us to store elements so they can be located quickly using keys the motivation for such searches is that each element typically stores additional useful information besides its search keybut the only way to get at that information is to use the search key specificallya map stores key-value pairs (kv)which we call entrieswhere is the key and is its corresponding value in additionthe map adt requires that each key be uniqueso the association of keys to values defines mapping in order to achieve the highest level of generalitywe allow both the keys and the values stored in map to be of any object type (see figure in map storing student records (such as the student' nameaddressand course grades)the key might be the student' id number in some applicationsthe key and the value may be the same for exampleif we had map storing prime numberswe could use each number itself as both key and its value figure conceptual illustration of the map adt keys (labelsare assigned to values (diskettesby user the resulting entries (labeled diskettesare inserted into the map (file cabinetthe keys can be used later to retrieve or remove values