The items of an array list are internally stored in a dynamic array. To store its elements, LinkedList makes use of a Doubly Linked List. Because manipulating an array takes longer, ArrayList is slow. Because it is node-based and requires less bit shifting, LinkedList is faster.

• ArrayList internally uses a dynamic array to store its elements.
• LinkedList uses Doubly Linked List to store its elements.
• ArrayList is slow as array manipulation is slower.
• LinkedList is faster being node based as not much bit shifting required.