Print All Root To Leaf Paths
Hard Acceptance 68.59% Points 40
You are given the root of a binary tree. Your task is to return all root-to-leaf paths. Each path should contain the node values from the root to a leaf.
A root-to-leaf path is a path that:
- Starts from the root node.
- Ends at a leaf node (a node with no children).
- Contains all node values encountered along the path.
Return a list containing all such paths.
Examples
Example 1
Input: root = [1,2,3,null,5]
Output: [[1,2,5],[1,3]]
Explanation: The tree has two root-to-leaf paths.
Example 2
Input: root = [1]
Output: [[1]]
Explanation: The root itself forms the only root-to-leaf path.
Example 3
Input: root = []
Output: []
Explanation: The tree contains no root-to-leaf paths.
Constraints
- 0 = Number of nodes = 105
- -10? = Node.data = 10?
Topics
Companies
Added 08 Aug 2026 68.59% acceptance
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.
Ln 1, Col 1Sign in to save your code
1 2 3
1 2 1 3
1 2 3 4 5
1 2 4 1 2 5 1 3
Sign in to run your code Run it on the sample cases, then submit against every hidden test.