From the documentation of LinkedHashMap
Hash table and linked list implementation of the Map interface, with predictable iteration order. This implementation differs from HashMap in that it maintains a doubly-linked list running through all of its entries. This linked list defines the iteration ordering, which is normally the order in which keys were inserted into the map (insertion-order).
So the ordering comes from the implementation of LinkedHashMap and not from extending java.util.AbstractMap<K,V>
or java.util.HashMap<K,V>