Differentiate between hashmap and treemap.
- 1 Answers
- 1045 Views
- I also Faced
- E-Mail Answers
Answer / Reeshoo Kumar Mishra
HashMap is a data structure that stores key-value pairs where keys are unique, unordered, and can be any type of object. It uses a hash function to map the keys to an array index. On the other hand, TreeMap is also a data structure for storing key-value pairs but it organizes its keys in a sorted fashion following a tree structure. This makes TreeMap useful when you need to maintain an ordered collection.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is adt example?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Can arraylist store primitives?
What is list and its types?
Mention some drawbacks of the linked list.
Why do we need searching algorithms?
What is difference between hashset and treeset?
How does a hashtable work?
Can we add or delete an element after assigning an array?
What is tree in computer science?
Which list does not allow duplicates?
How to find the missing element in integer array of 1 to 7?
Windows 
