Using linked-list insertion and binary-tree traversal as examples, this post argues that algorithm learning works better when you draw the structure, simulate the steps, explain the invariant, and only then write code.