title: Why do we use data structures? (when no dynamic allocation is needed)
body: <p><em>I'm pretty sure this is a silly newbie question but I didn't know it so I had to ask...</em></p>
  
  <p>Why do we use data structures, like Linked List, Binary Search Tree, etc? (when no dynamic allocation is needed)</p>
  
  <p>I mean: wouldn't it be faster if we kept a single variable for a single object? Wouldn't that speed up access time? Eg: BST possibly has to run through some pointers first before it gets to the actual data.</p>
  
  <p>Except for when dynamic allocation is needed, is there a reason to use them?</p>
  
  <p>Eg: using linked list/ BST / std::vector in a situation where a simple (non-dynamic) array could be used.</p>