Linked List Find Function C++
<p>How would you go about implementing a find function in a non templated C++ linkedList?</p>

<p>The remove function is implemented in the following way: </p>

<pre><code> bool LinkedList::remove(Node* n)
 {
      Node *temp = front, *prev = 0;

      for(int i = 0;i &lt; size; i++)
      {
           if (temp == n) 
           {
                if (temp == front)
                {
                     front = n-&gt;next;
                } 
                else 
                {
                     prev-&gt;next = temp-&gt;next;
                }

               delete temp;
               size --;
               return true;
          }
          prev = temp;
          temp = temp-&gt;next;
     }
     return false;
}
</code></pre>
