A sloppy LinkedList<TVal>.Remove(ILinkedNode<int, TVal> node) method.

gistfile1.cs

        public bool Remove(ILinkedNode<int, TVal> node)
        {
            if (this.Count.Equals(0))
            {
                return false;
            }

            bool removed = false;
            if (this.First.Equals(node))
            {
                this.First = this.First.Next;
            }
            else if (this.Last.Equals(node))
            {
                this.Last = this[this.Count - 2];
                this.Last.Next = null;
            }
            else
            {
                ILinkedNode<int, TVal> previous = null;
                ILinkedNode<int, TVal> current = this.First; // skip the first, its not needed, already tested
                while (null != current && !removed)
                {
                    if (current.Equals(node))
                    {
                        current = current.Next;

                        if (null != previous)
                        {
                            previous.Next = current;
                        }
                        removed = true;
                        break;
                    }

                    previous = current;
                    current = current.Next;
                }
            }

            this.Count = 0;
            ILinkedNode<int, TVal> n = this.First;
            while (null != n)
            {
                n.Key = this.Count;
                n = n.Next;

                this.Count++;
            }

            return removed;
        }