Question

A linked list is called lovely linked list (l3) if all of its even-data nodes are adjacent to each other.

Answer 1

18 down vote accepted

The requirement of not invalidating iterators except the one on a node being deleted is forbidding to every container that doesn't allocate individual nodes and is much different from e.g. list or map.
However, I've found that in almost every case when I thought that this was necessary, it turned out with a little discipline I could just as well do without. You might want to verify if you can, you would benefit greatly.