title: Is a Linked-List implementation without using pointers possible or not?
body: <p>My question is very simple, can one using C++, implement a link-list data structure without using pointers (next nodes)? To further qualify my question, I'm mean can one create a Linked-List data structure using only class instantiations.</p>
  
  <p>A common node definition might be like so:</p>
  
  <pre><code>template&lt;typename T&gt;
  struct node
  {
     T t;
     node&lt;T&gt;* next;
     node&lt;T&gt;* prev;
  };
  </code></pre>
  
  <p>I'm aware of <code>std::list</code> etc, I'm just curious to know if its possible or not - and if so how? Code examples will be greatly appreciated.</p>
  
  <p>More clarifications:</p>
  
  <ol>
  <li>Insertions should be O(1). </li>
  <li>Traversal should be no more than O(n).</li>
  <li>A real node and a null node should be differentiable.</li>
  <li>The size of the linked-list should only be limited by the amount of memory available.</li>
  </ol>