Module 11: Collections Framework Deep Dive
List Implementations: ArrayList, LinkedList, Vector
Compare performance characteristics and use cases.
ArrayList: O(1) random access, amortized O(1) insertion at end.
LinkedList: O(1) insertion/removal at ends but O(n) access—great for deque usage.
Vector is synchronized legacy; prefer ArrayList plus explicit synchronization or CopyOnWriteArrayList.