ArrayList and LinkedList usage and difference

1.ArrayList is the realization of the data structure based on dynamic array, LinkedList data structure based on linked list.
2. For random access get and set,arraylist feel better than LinkedList, because linkedlist to move the pointer.
3. Add and Remove,linedlist are the dominant for new and deleted operations because ArrayList is moving the data.

For ArrayList and LinkedList, size () IsEmpty () These are constant calculations, at very low cost

LinkedList implements more methods, including queue, so it is also a queue

For temporary storage of a small number of elements, priority is given to ArrayList

Frequent add and delete operations, priority use of LinkedList

Frequent traversal by index access, with priority to ArrayList

ArrayList and LinkedList usage and difference