18$Java$Interview$Questions$–$www.JavaInterview.in! !
!
!
If!existing!key!is!reused,!it!would!replace!existing!value!with!the!new!value!passed!in.!
//In!the!example!below,!an!entry!with!key!"ponting"!is!already!present.!!
//Runs!are!updated!to!11800.!
hashmap.put("ponting",!new!Cricketer("Ponting",!
!!!!!!!!11800));!
!
//gets!the!recently!updated!value!
System.out.println(hashmap.get("ponting"));//Ponting!11800!
What(is(a(TreeMap?(How(is(different(from(a(HashMap?(
TreeMap!is!similar!to!HashMap!except!that!it!stores!keys!in!sorted!order.!It!implements!NavigableMap!
interface!and!SortedMap!interfaces!along!with!the!Map!interface.!
Map<String,!Cricketer>!treemap!=!new!TreeMap<String,!Cricketer>();!
treemap.put("sachin",!
!!!!!!!!new!Cricketer("Sachin",!14000));!
System.out.println(treemap);!
//{sachin=Sachin!14000}!
!
We!will!now!insert!a!Cricketer!with!key!dravid.!In!sorted!order,dravid!comes!before!sachin.!So,!the!value!
with!key!dravid!is!inserted!at!the!start!of!the!Map.!
treemap.put("dravid",!
!!!!!!!!new!Cricketer("Dravid",!12000));!
System.out.println(treemap);!
//{dravid=Dravid!12000,!sachin=Sachin!14000}!
!
We!will!now!insert!a!Cricketer!with!key!ponting.!In!sorted!order,!ponting!fits!in!between!dravid!and!
sachin.!!
treemap.put("ponting",!new!Cricketer("Ponting",!
!!!!!!!!11500));!
System.out.println(treemap);!
//{dravid=Dravid!12000,!ponting=Ponting!11500,!sachin=Sachin!14000}!
!
treemap.put("bradman",!new!Cricketer("Bradman",!
!!!!!!!!9996));!
System.out.println(treemap);!
//{bradman=Bradman!9996,!dravid=Dravid!12000,!ponting=Ponting!11500,!sachin=Sachin!
14000}!
Can(you(give(an(example(of(implementation(of(NavigableMap(Interface?(
TreeMap!is!a!good!example!of!a!NavigableMap!interface!implementation.!Note!that!keys!in!TreeMap!are!
sorted.!
!
TreeMap<Integer,!Cricketer>!numbersTreeMap!=!new!TreeMap<Integer,!Cricketer>();!
numbersTreeMap.put(55,!new!Cricketer("Sachin",!
!!!!!!!!14000));!
numbersTreeMap.put(25,!new!Cricketer("Dravid",!
!!!!!!!!12000));!