You didn't get it right.
LinkedHashMap(as well as HashMap) store its key-value pairs inside array. This array is array of special Entry objects that store your key and value.
One Entry instance stores only one key-value pair you provided.
However array can store multiple Entry instances at same bucket. Why?
Because index at which Entry is stored in array is calculated by using hashCode() method of key you provided. And that calculation can result in index which is occupied by previous Entry. To resolve this problem they decided to store multiple Entry objects at single index of array. As you know this is done due to linked list - one Entry references another Entry.
BUT LinkedHashMap additionally keeps Entry instances in way of linked list. Why? By storing Entry objects as linked list LinkedHashMap can guarantee order.
So LinkedHashMap stores Entry objects in array and additionally as linked list.
By storing Entry objects as linked list LinkedHashMap can store you key-value pairs(Entry objects) in insertion or access order.
You choose insertion or access order when creating LinkedHashMap in constructor. Note default order is insertion order.
Please review my
LinkedHashMap tutorial to know it better as well as other java collections.