Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

EECS 281: Data Structures and Algorithms, 24 Fall. This notes include implementations of basic data structures: union-find sets, unordered_map by hash table, AVL tree, graph represented by adjacency ...