

ArrayDeque – Extends AbstractCollection and implements the Deque interface to implement a dynamic double-ended queue.ArrayList – Extends AbstractList to implement a dynamic array.LinkedList – Extends AbstractSequentialList to implement a linked list.AbstractSequentialList – Extends AbstractList and uses sequential rather than random access of its elements.AbstractQueue – Extends AbstractCollection and implements parts of the Queue interface.AbstractList – Extends AbstractCollection and implements most of the List interface.AbstractCollection – Implements most of the Collection interface.The main collection classes are as below: Generally, Collection Classes are not synchronized, but it is possible, by some modification, to achieve synchronization as well. The Collection Classes are the standard classes that implement the Collection Interfaces. Note: All other Collection Interfaces are declared in the same manner. Here, O specifies the type of objects that the list will be working with. SortedSet – Extends Set to work with a sorted sets.Īs an example, the List interface is declared as the following.Set – Extends Collection to work with the sets containing unique elements.


NavigableSet – Extends SortedSet to work with the retrieval of elements which are based on the closest-match searches.List – Extends Collection to work with the lists of objects.Deque – Extends Queue to work with the double-ended queue.Collection – Top of the collections hierarchy.
