Automaters: Full Stack QA_SDET: Top 5 differences between Arraylist and Linkedlist? Arraylist vs Linked list? When to use arraylist and linkedlist?Interview question for Automation testing/Core Java?

Monday 25 November 2019

LinkedList can be iterated in reverse direction using descendingIterator() but to iterate over the ArrayList in reverse direction we need to write our own code
Insertions and Deletions are faster in LinkedList as compared to ArrayList because there is no need of resizing array and copying content to new array if array gets full which makes adding into ArrayList of O(n) in worst case, while adding is O(1) operation in LinkedList in Java. so if we have more add or delete operations then we should go with Linked list.
LinkedList has more memory overhead as each node holds both data and address of next and previous node but in ArrayList each index only holds actual object or we can say data.
ArrayList internally uses a dynamic array while LinkedList internally uses a doubly linked list.
Arraylist get method is faster than Linked list so fetching data or search operations is good in arraylist.

*************************************************