developer-roadmap/roadmaps/leetcode/content/binary-tree-maximum-path-sum@5htwCuI4Dz_G2ar1enQZv.md

Binary Tree Maximum Path Sum

Given a binary tree where nodes can have negative values, find the maximum sum of any path between any two nodes. At each node you decide whether to extend either child's path or start fresh, tracking the global maximum as you go. This is one of the hardest tree DFS problems and teaches you to separate what you return up the recursion from what you record as your answer.

Visit the following resources to learn more:

• @article@Binary Tree Maximum Path Sum
• @video@Binary Tree Maximum Path Sum - LeetCode 124 - Python
• @video@LeetCode 124. Binary Tree Maximum Path Sum