Maximum Root to Leaf Path Sum
You are given the root of a binary tree. Your task is to find the maximum path sum among all root-to-leaf paths.
A root-to-leaf path sum is the sum of all node values encountered while traversing from the root node to a leaf node.
Return the largest possible sum among all such paths.
Input: root = [1,2,3]
Output: 4
Explanation: The two root-to-leaf paths are 1 → 2 (sum = 3) and 1 → 3 (sum = 4). The maximum is 4.
Input: root = [10,5,15,null,null,6,null,null,7]
Output: 32
Explanation: Evaluating every root-to-leaf path, the largest total is 10 → 15 → 7 = 32.
Input: root = [-5]
Output: -5
Explanation: The only path consists of the single root node, so the maximum sum is -5.
- 1 = Number of nodes = 104
- -10? = Node.data = 10?
See how the best solutions work
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Keep every attempt
Your submissions, results and runtime history live here. Sign in to start your streak.
1 2 3 4 5 6 7
11
10 5 15 2 7 12 20
45