LinkedList

LinkedList is the other List implementation in the standard library, and it works very differently from ArrayList. Instead of storing items in a backing array, it strings them together as a chain of node objects, each one pointing to the next and previous neighbor. That choice changes the cost of almost every operation, and it also lets LinkedList double as a queue or stack because it implements the Deque interface as well. This lesson covers the internal structure, the cost of each common operation, and the narrow set of situations where LinkedList is actually the right pick over ArrayList.