 |
IT-Interview.com:Open Database for IT Professionals to share interview questions, answers and knowledge. |
Open Question
Difference between HashMap and TreeMap
(Time Left: 0 days 0 hours)
asked by: maxpwnge on: Jul 22, 2009 Answers ( 5 )
HashMap will not store the elements in order.Whereas TreeMap stores in order.so while retrieving we will get in a particular order.But for HashMap we won't.
mushixx2 answered on：Jul 24, 2009 0 comments good peanut_breath answered on：Jul 26, 2009 0 comments 1> Treemap are sorted map while hashmap are not aj5122003 answered on：Jul 27, 2009 0 comments The following link provides a table with details of collections in java.
razor90 answered on：Jul 29, 2009 0 comments Differences...
a> HashMap provides the implementation of Map Interface by using hashtable
where as TreeMap provides the implementation of Map Interface by using Tree.
b> HashMap does not guarntee any order
TreeMap provides sorted order
happy2smile answered on：Jul 30, 2009 0 comments Hot Questions
• I want to know output of this program and the flow alsopublic class Aquestion { ...
• what is root class of all java classes
• Can HashMap store null values?If yes, how many and in which one?
• How many ways we can create object ?
• why java is not 100% oops
• In the declaration of strings, String s1="abc"; String s2="xyz"; String s3=ne...
• what is root class of all java classes
• Can HashMap store null values?If yes, how many and in which one?
• How many ways we can create object ?
• why java is not 100% oops
• In the declaration of strings, String s1="abc"; String s2="xyz"; String s3=ne...