- Stanford Library - Binary Tree
- Done. Completed up to problem 15
- BT vs BST
- Done. Notes in binary-tree.md
- Pre-order, In-order, Post-order, Level Order Traversals
- Done. Notes in binary-tree.md
- Stanford Library - Linked List
- Done. Completed up to problem 17
- Some of these problems are C/C++-specific and not really meant for Java.
- Problems 13, 14, 17, and 18 provide interesting iterative vs recursive comparisons that are worth reviewing.
- LeetCode Tree Problems 94-96, 98-100

- Java Collections: ArrayList, HashMap, LinkedList, Stack
- Notes in java-collections.md
- LeetCode Tree Problems 101-106

- LeetCode Google Problems 1-3, 5

- Java Collections: TreeSet, LinkedHashSet, HashSet
- Notes in java-collections.md
- LeetCode Array Problems 11, 15, 16, 18, 26, 27, 31

- LeetCode Google Problems 17, 20, 22

- LeetCode Binary Search Problems 29, 33-35, 50, 69

- LeetCode Google Problems 54, 56, 66

- The Algorithm Design Manual, Chapter 1
- LeetCode Heap Problems 23, 215, 218, 239, 253, 264, 295

- LeetCode Google Problems 155, 162, 173

- The Algorithm Design Manual, Chapter 2
- Review Sorts: Quick, Merge, Insert, Bubble
- Java: equals(), hashCode(), Comparator