Can you modify the lazy algorithms remove () so it locks only one node?

In the lock-free algorithm, argue the benefits and drawbacks of having the contains () method help in the clean-up of logically removed entries.

In the lock-free algorithm, if an add () method call fails because pred does not point to curr, but pred is not marked, do we need to traverse the list again from head in order to attempt to complete the call?