The LinkedList class extends AbstractSequentialList and implements the List, Deque, and Queue interfaces, the LinkedList follows double LinkedList concept to store values, the below things you need to consider before choosing LinkedList
if you are planning to add elements in between list elements then the LinkedList is faster than ArrayList
if you want to read elements values based upon index number then LinkedList is faster than ArrayList
The LinkedList allows duplicate values
The LinkedList follows Double LinkedList concept if you see the below diagram every node has a reference to previous and next node, the advantage with this if you add a new node in between something like node 45 to node 55, it will not shift all nodes like in ArrayList it will just update references of previous and next records
A technology enthusiast and a professional blogger from India. Through out my IT career, I have had the pleasure of working on various new technologies and built products like www.ziprides.com and some other products. Unfortunately, my attempts have not given me the desired results and as a result, I have finally decided to build a professional blog where I would like to share all my learnings and hoping to learn from other enthusiasts around the world.