{"id":3446,"date":"2021-08-02T12:31:12","date_gmt":"2021-08-02T12:31:12","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=3446"},"modified":"2022-07-01T06:42:04","modified_gmt":"2022-07-01T06:42:04","slug":"treemap-vs-hashmap-vs-linkedhashmap-in-java","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/treemap-vs-hashmap-vs-linkedhashmap-in-java\/","title":{"rendered":"Treemap vs Hashmap vs Linkedhashmap in Java"},"content":{"rendered":"

\"\"<\/p>\n

While learning Java<\/a>, you all must have come across these terms of TreeMap, hashmap, Linkedhashmaps also have used these data structures and their implementations in your programs. But what is the difference between these three implementations and when to use which one?<\/p>\n

Well, in this brief blog on the differences between Treemap, Hashmap, and Linkedhashmap, we will take you through the most basic differences and give you an idea of their applications.<\/p>\n

Introduction<\/h3>\n

Maps, as we know store key-value pairs, hence as we can comprehend each of Treemap, Hashmap, and Linkedhashmap<\/a> stores the elements as key-value pairs by implementing the java.util.Map<\/code> interface but the only difference comes into play when we observe their time complexities. <\/p>\n

TreeMap<\/strong>: This kind of map stores elements in an ordered fashion of keys and when iterating you can iterate through the keys in sorted order only. This means the elements also implement their comparable interface by which they make the comparisons for sorting. Under the hood, TreeMap is implemented by Red-Black Trees, and hence their insertion and lookup time is O(logn).<\/p>\n