Home / Questions / Why deletion in LinkedList is fast than ArrayList?
Explanatory Question

Why deletion in LinkedList is fast than ArrayList?

👁 728 Views
📘 Detailed Answer
🕒 Easy to Read
Read the answer carefully and go through the related questions on the right side to improve your understanding of this topic.

Answer with Explanation

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.