title: List of fundamental data structures - what am I missing?
body: <p>I've been studying my fundamental data structures a bunch recently, trying to make sure I've got them down cold.</p>
  
  <p>By "fundamental", I mean the real basic ones. Fancy ones like Red-Black Trees and Bloom Filters are clearly worth knowing, but they're usually either enhancements of fundamental ones (Red-Black Trees are binary search trees with special properties to keep them balanced) or they're only useful in very specific situations (Bloom Filters).</p>
  
  <p>So far, I'm "fluent" in the following data structures:</p>
  
  <ul>
  <li>Arrays</li>
  <li>Linked Lists</li>
  <li>Stacks/Queues</li>
  <li>Binary Search Trees</li>
  <li>Heaps/Priority Queues</li>
  <li>Hash Tables</li>
  </ul>
  
  <p>However, I feel like I'm missing something. Are there any fundamental ones that I'm forgetting about?</p>
  
  <p><strong>EDIT: Added these after posting the question</strong></p>
  
  <ul>
  <li>Strings (suggested by catchmeifyoutry)</li>
  <li>Sets (suggested by Peter)</li>
  <li>Graphs (suggested by Nick D and aJ)</li>
  <li>B-Trees (Suggested by tloach)
  
  <ul>
  <li>I'm a little on-the-fence about whether these are too fancy or not, but I think they're different enough from the fundamental structures (and important enough) to be worth studying as fundamental.</li>
  </ul></li>
  </ul>