GYANEXIS
Data StructuresModule 1
Contents
  1. Arrays make position-based access simple
  2. A stack removes the most recent item
  3. A queue serves the oldest item
  4. Trace binary search rather than memorizing it
  5. Complexity and boundary checks