One challenge that the fine grain lock approach faces is referred to as the ABA problem. Suppose we would like to delete a node from a linked list at an address pointed by p, having a key value 5. The deletion thread T₁ has found the node, but before it can perform the deletion, another thread T₂ successfully performs two operations.