LinkedList Vs ArrayList
ArrayList is based on Array and LinkedList based on LinkedList.
LinkedList implements Deque interface, which provides first in first out operation(FIFO) and other Deque method.
Adding element in ArrayList is costly because it will trigger re-sizeing of the array
Remove an element from a particular index in ArrayList is costly because ArrayList performs the copy operation.
Iteration is O(n) operation for both LinkedList and ArrayList where is n is number of element.
Retrieving operation is 0(1) in ArrayList while its 0(n/2) in LinkedList, as it can traverse from both end.LinkedList will use more memory because it stores value as well as address of the next node.