Since the overhead/mem usage of ArrayList will be ...

# random

[jo]

Since the overhead/mem usage of ArrayList will be 2*n and linked list has to store 2x for every item, that means the array list is hitting memory once for a continuous chunk every n items and linked list is hitting it twice for every insert every item.