title: What is the use of Generic LinkedList < T > in C#
body: <p>In old times we all were dealing with Arrays, then link lists came boasting the following:</p>
  
  <ol>
  <li>it can grow and shrink at runtime by allocating and deallocating
  memory.  </li>
  <li>Insertion and Deletion. Insertion and deletion of nodes are
   really easier.</li>
  <li>No Memory Wastage.</li>
  <li>Traversal.</li>
  <li>Reverse Traversing</li>
  </ol>
  
  <p>While all above is true versus Arrays, I cannot find any benefit of a LinkedList over Generic <code>List&lt;T&gt;</code> ,as <code>List&lt;T&gt;</code> has all of the above properties.</p>
  
  <p>Also, I have never seen LinkedList be used in any NET program.</p>
  
  <p>I'm just looking to see if there is a situation which <code>LinkedList&lt;T&gt;</code> has an advantage over <code>List&lt;T&gt;</code></p>
  
  <p>===============================================</p>
  
  <p>Thank you all for your feedbacks! The link above proved to be very helpful.</p>
  
  <p>Based on the above link and comments, at least in .NET world, LinkedList seems to be much inferior to LIST. </p>