LinkedList does not implement the RandomAccess interface, whereas implements the interface (instead of Deque interface).

calling constructure ArrayList(initialCapacity)Д«y default, an creates a list of initial capacity 10, while LinkedList only constructs an empty list without any initial capacity. It also includes a method void trimToSize()to reduce the size based on existing elements. It is possible to specify the initial capacity of an ArrayList through the constructor ArrayList(int initialCapacity) and later increases the capacity using void ensureCapacity(int minCapacity), if necessary, to ensure that it can hold at least the number of elements specified by the minimum capacity argument. It is internally implemented as an object array, which can increase the size as necessary to support more number of elements in the collection. ArrayListДЄrrayList is a resizable-array implementation of the List interface. Other interfaces it implements are Serializable, Cloneable, and Deque (with super-interface as Queue). In a doubly-linked list, every node points to its previous and next node. LinkedList in Java is a doubly-linked list implementation of the List interface. The linked list itself contains a reference to the first element of the list, which is called the head element. The last element (or tail) of the sequence points to a null element. The LinkedList data structure contains an ordered set of data elements (know as nodes) such that each element contains a link or reference to its successor ( next element). Vector is similar to ArrayList except they are provided with automatic synchronization, which makes them thread-safe but causes some performance overhead.

What is better array vs arraylist