Lessons

Learning materials and resources.

---

Explore Lessons

• Arrays and Nodes - Dynamic arrays, abstraction, linked nodes, and encapsulation.
• Algorithm Analysis and Sorting - Asymptotic analysis, iterative sorts, and merge sort.
• Search Trees - Binary search trees, tries, and 2-3 trees.
• Isomorphism and Heaps - Left-leaning red-black trees, AVLs, and heaps.
• Hashing and Midterm Review - Hash tables and affordance analysis.
• Midterm and Graphs - Graph data type and traversals.
• Graph Algorithms - Shortest paths trees, dynamic programming, and minimum spanning trees.
• Applications - Disjoint sets and iterative design.