Is this a good way to iterate through a .NET LinkedList and remove elements?

Question

I'm thinking of doing the following:

for(LinkedListNode<MyClass> it = myCollection.First; it != null; it = it.Next)
{
    if(it.Value.removalCondition == true)
        it.Value = null;
}

What I'm wondering is: if simply pointing the it.Value to null actually gets rid of it.

Answer 1

Setting the it.Value to null will not remove the node from the list Here is one way:

    for(LinkedListNode<MyClass> it = myCollection.First; it != null; )
    {
        LinkedListNode<MyClass> next = it.Next;
        if(it.Value.removalCondition == true)
              myCollection.Remove(it); // as a side effect it.Next == null

        it = next;
    }

Answer 2

Surely (with a linked list) you need to change the link.

Eg, if you want to remove B from the LL A-B-C, you need to change A's link to B to C.

I'll admit I'm not familiar with the .NET implementation of linked lists but hopefully that's a start for you.