Java Programming - Objects and Collections - Discussion
The iteration order of a Collection is the order in which an iterator moves through the elements of the Collection. The iteration order of a LinkedHashMap is determined by the order in which elements are inserted.
When a new LinkedHashMap is created by passing a reference to an existing Collection to the constructor of a LinkedHashMap the Collection.addAll method will ultimately be invoked.
The addAll method uses an iterator to the existing Collection to iterate through the elements of the existing Collection and add each to the instance of the new LinkedHashMap.
Since the iteration order of the LinkedHashMap is determined by the order of insertion, the iteration order of the new LinkedHashMap must be the same as the interation order of the old Collection.
If the existing instance is a TreeMap then the iteration order will be the natural order of the keys. If the existing instance is a LinkedHashMap then the iteration order will be the order of insertion.
Surely, therefore it depends on the existing instance. If the existing instance is a TreeMap then you would want a TreeMap and if the existing instance is a LinkedHashMap you would want a LinkedHashMap.
TreeMap maintains natural sorted order not insertion order.