Why deletion in LinkedList is fast than ArrayList?

Question

Accepted 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.

Why deletion in LinkedList is fast than ArrayList?

Answer with Explanation