Learn how to use structural pattern matching (the match statement) to work recursively through tree-like structures.
The 2 hardest problems in programming are naming, cache invalidation, and off-by-one errors.