Lesson 1 of 5
Data structure atlas
One goal, several useful shapes
Pick a structure to see the promise it makes to your algorithm.
Linear structures
Values follow a sequence, so position and order matter.
Associative structures
A key names a value, so lookup does not depend on position.
Connected structures
Links express hierarchy, routes, dependencies, or networks.
Linear structures
Array
Fast indexed access and compact ordered data.
Core operations
read by indexupdatescan
Memory sketch[A][B][C][D]
A data structure is a deliberate way to organize values and the relationships between them. The shape is not decoration: it decides which operations become easy, fast, and safe.
Your call · What makes one data structure different from another?