There are two general-purpose List implementations in the Collection Framework: ArrayList and
LinkedList. Which of two List implementations should be used depends on the specifi c needs. If
random access needs to be supported, without inserting or removing elements from any place other
than the end ArrayList offers the optimal collection. If, however, one needs to frequently add and
remove elements from the middle of the list and only access the list elements sequentially LinkedList
offers the better implementation.
Each of the classes is discussed in turn:
ArrayList Class ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.