Objective
Master depth-first search on trees and graphs from the RisingBrain DSA sheet.
References
Pattern Description
Recurse depth-first. On trees: pre/in/post-order. On graphs: maintain a visited set to avoid cycles.
Sub-issues
| # |
Problem |
Difficulty |
| 1 |
Maximum Depth of Binary Tree |
Easy |
| 2 |
Path Sum |
Easy |
| 3 |
Lowest Common Ancestor of Binary Tree |
Medium |
| 4 |
Binary Tree Maximum Path Sum |
Hard |
| 5 |
Max Area of Island |
Medium |
Notes
Language: Java
Objective
Master depth-first search on trees and graphs from the RisingBrain DSA sheet.
References
Pattern Description
Recurse depth-first. On trees: pre/in/post-order. On graphs: maintain a visited set to avoid cycles.
Sub-issues
Notes
Language: Java