Product
Pricing
Blog
Forum
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
AI Insights
Quick Summary
Find the root-to-leaf path in a binary tree with the smallest sum of node values.
Return the sequence of node values along that minimum sum path.
Correctly handle negative values and tie-breaking scenarios.
What This Tests
Recursive tree traversal (Depth-First Search)
Path state management and backtracking mechanics
Tracking and updating global minimums during recursion
Identifying leaf node base cases
Common Patterns
DFS/BFS
Backtracking
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Report
Report seen similar question in interview
Accepted
980
/1.8k
Acceptance Rate
55.2%
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Python3
Auto
Debug
Run
Submit
Test Cases
Input
root =
Output
Expected
