c# search algorithm

gistfile1.txt

public bool search(T val)
        {
            DNode<T> iterator = head;
            if (head == null)
                return false;
            else
            {
                while (iterator != null)
                {
                    if (iterator.Value.CompareTo(val) == 0)
                    {
                        if (iterator.Next == null)
                        {
                            iterator.Prev.Next = null; 
                            iterator.Next = head;
                            head.Prev = iterator;
                            head = iterator;
                            return true;
                        }
                        else if(iterator==head)
                        {
                            return true;
                        }
                        else
                        {
                            iterator.Next.Prev = iterator.Prev;
                            iterator.Prev.Next = iterator.Next;
                            iterator.Next = head;
                            head.Prev = iterator;
                            head = iterator;
                            return true;
                        }
                    }
                    iterator = iterator.Next;
                }
                return false;
                
            }
        }