How can I (or should I) use pointers in my linked list
<p>I'm creating a Linked List program and I currently have this method to insert an item into the front of the list:</p>

<pre><code>template &lt;class T&gt;
void LinkedList&lt;T&gt;::insert(T *o)
{
    node newNode;
    newNode.o = o;
    newNode.next = first;
    newNode.prev = NULL;
    first-&gt;prev = &amp;newNode;
    first = &amp;newNode;
}
</code></pre>

<p>where I have a struct as follows:</p>

<pre><code>struct node {
node   *next;
node   *prev;
T      *o;
};
</code></pre>

<p>I think my logic is right for the insert method; however, I feel as if I'm not doing it properly, specifically dealing with the pointers.  I feel as if I have to many newNode.  lines and that I could do this better somehow.  Any suggestions or is it right?</p>

<p>Note: I'm new to C++ so please be kind.  I know this is a simple question</p>
