Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

* Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the large list you see today. After going through this study plan, I got hired as a ...

remove-circle Internet Archive's in-browser video "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your ...