Depth-First Search pattern
Binary Tree Maximum Path Sum
Given the root of a binary tree, return the maximum sum of any non-empty path. A path is a sequence of connected nodes and need not pass through the root. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 124
- Hard
- 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 124
Hard
The approach
- 01 Recursive DFS (post-order gain + global max) O(n)O(h) space
What you will learn
- How to read Binary Tree Maximum Path Sum and spot the depth-first search pattern in it
- Recursive DFS (post-order gain + global max): 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 Binary Tree Maximum Path Sum 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.