Data Structures Overview

By Deane Barker on December 25, 2008

Arrays, What’s the point?: The first answer to this question is one of the best high-level overviews of data structures I’ve ever seen. It explains.

  1. Why arrays are 0-based instead of 1-based
  2. Why arrays have super-fast access times.
  3. Why arrays have slow search times.
  4. What Linked Lists are.
  5. Why Binary Trees are.
  6. Why Binary Trees can be crazy fast to search.

If you’re a programmer, this is so worth five minutes of your time.

Gadgetopia