Practice Binary Tree Maximum Path Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Binary Tree Maximum Path Sum
Problem Statement
A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the root of a binary tree, return the maximum path sum of any non-empty path.
Source: Binary Tree Maximum Path Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
root = [1,2,3]
6
# Example 2
root = [-10,9,20,null,null,15,7]
42
Constraints
Related LeetCode Problems
Practice more problems similar to Binary Tree Maximum Path Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.