Available question text
Given a binary tree, find the maximum sum path from any leaf node to the root. Example: Input: A binary tree where 10 is the root, 30 and 15 are its children, and 20 and 5 are children of 30. Output: 60. Explanation: There are three leaf-to-root paths: 20->30->10 (sum=60), 5->30->10 (sum=45), and 15->10 (sum=25). The maximum sum is 60, achieved by the path 20->30->10.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Maximum Level Sum of a Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Maximum Sum Leaf to Root Path in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source