LinkedHasmap and TreeMap in java #collection #collectionsframework

#Java Collections #ArrayList #LinkedList #PriorityQueue #HashMap #TreeMap #sets
LinkedHashMap: It's a map implementation that combines the features of a HashMap and a LinkedList. It maintains a doubly linked list alongside the hash table, allowing it to maintain the insertion order of its entries. Thus, when iterating through a LinkedHashMap, the order is the same as the order in which elements were inserted.

TreeMap: TreeMap is a map implementation that maintains its entries in sorted order based on the natural ordering of its keys or a custom comparator. It's implemented as a Red-Black tree structure, which ensures that the keys are ordered. TreeMap provides efficient retrieval of keys/values in sorted order but doesn't maintain insertion order.