Why deletion in LinkedList is fast than ArrayList?

Java Programming Language >   Fundamentals of Object-Oriented Programming >   About Java Tutorial  

Short Question

754


Answer:

Deletion in linked list is fast because it involves only updating the next pointer in the node before the deleted node and updating the previous pointer in the node after the deleted node.


This Particular section is dedicated to Question & Answer only. If you want learn more about Java Programming Language. Then you can visit below links to get more depth on this subject.




Join Our telegram group to ask Questions

Click below button to join our groups.