Depth-First Search pattern
Path Sum II
Given the root of a binary tree and a target sum, return all root-to-leaf paths whose node values add up exactly to the target. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 113
- Medium
- 1 approach
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Depth-First SearchLeetCode 113
Medium
The approach
- 01 Recursive DFS + backtracking O(n)O(h) space
What you will learn
- How to read Path Sum II and spot the depth-first search pattern in it
- Recursive DFS + backtracking: O(n) time, O(h) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Depth-First Search
See Path Sum II run, step by step
Sign in and this page opens on the animation, with all 18 Depth-First Search problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.