ArrayList uses arrays at the bottom and LinkedList uses linked lists at the bottom. ArrayList and LinkedList logical structures are both characteristics of linear table arrays
- Index query is efficient
- Delete and insert elements to be moved
- Continuous memory space is required
The list
- Queries are less efficient because elements are iterated over
- Insert and delete only need to modify the pointer
- No contiguous memory space is required for storage