Problem
Given a binary tree (nodes with integer values), print all root-to-leaf paths where the sum of node values is K. Each path: space-separated node values.
Input format
Input
input.txt
- First line: N (number of nodes, 1 ≤ N ≤ 15) - Second line: N integers (level order, -999 for null) - Third line: K
Output format
Output
output.txt
- Each path, one per line
Example
input
5 5 4 8 11 -999 13 4 27
output
5 4 11 7 5 8 13 1
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
5 5 4 8 11 -999 13 4 27
Expected output
5 4 11 7 5 8 13 1
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc