Week 6: Binary Trees & BSTs
Move from linear to hierarchical data structures. Master Depth-First Search (DFS), Breadth-First Search (BFS), and the properties of Binary Search Trees in Java.
Move from linear to hierarchical data structures. Master Depth-First Search (DFS), Breadth-First Search (BFS), and the properties of Binary Search Trees in Java.
Transition from trees to general networks. Master graph representations, Adjacency Lists, and grid-based DFS/BFS traversals in Java.