← Quit0 / 0 correct
What is the ABA problem in lock-free data structures?
T1 reads head = A T2 pops A, pops B, pushes A T1 CAS(head, A → next) succeeds ✗ (next is stale B, already freed)
What is the ABA problem in lock-free data structures?
T1 reads head = A T2 pops A, pops B, pushes A T1 CAS(head, A → next) succeeds ✗ (next is stale B, already freed)