COMP 250
McGill
Course Overview
Lessons & Practice
1. Important Exam Information
2min2. Linear Data Structures
36min3. Recursion
26min4. Non-linear Data Structures
1.1hr4.3.1. Binary Trees: Explained4.3.2. Tree Traversal: Breadth-First Search or BFS4.3.3. Tree Traversal: Breadth-First Search or BFS (Similar to Fall 2015 final exam question #5)4.3.4. Tree Traversal: Depth-First Search or DFS (Pre-Order Traversal)4.3.5. Tree Traversal: DFS (Pre-Order Traversal) (Similar to Fall 2012 final exam question #5)4.3.6. Tree Traversal: Depth-First Search or DFS (In-Order Traversal)4.3.7. Tree Traversal: DFS (In-Order Traversal) (Similar to Fall 2015 final exam question #5)4.3.8. Tree Traversal: Depth-First Search or DFS (Post-Order Traversal)4.3.9. Tree Traversal: DFS (Post-Order Traversal) (Similar to Fall 2015 final exam question #5)
