1 Complexity Analysis and Recursion 5 sections, 2 - 3 hours
2 Search and Sorting Algorithms 3 sections, 2 - 3 hours
3 Linked Lists 5 sections, 1 - 2 hours
4 Stacks and Queues 4 sections, 2 - 3 hours
5 Binary Search Trees and Heaps 6 sections, 2 - 3 hours
6 Hash Tables 3 sections, 2 - 3 hours
7 Graphs 4 sections, 2 - 3 hours
{ Big O Exercises. }
Complete the Big O exercises here.
When you're ready, move on to Introduction to Recursion
