# Root to Leaf Path

Moderate
0/80
Average time to solve is 25m
Contributed by

## Problem statement

Ninja is having a good time in solving new questions of Binary Trees from Code Studio. He is now encountered with a question having statement as "You are given a binary tree consisting of 'N' nodes numbered from 1 to 'N'. Your task is to print all the root to leaf paths of the binary tree".

Ninja is stuck into this problem and could not able to find the logic. Help Ninja in solving the problem.

Note :

``````A leaf of a Binary Tree is the node which does not have a left child and a right child.
``````
For Example :
``````Given a binary tree :
``````

``````All the root to leaf paths are :
1 2 4
1 2 5
1 3
``````

Note :

``````1. Two nodes may have the same value associated with it.
2. The root node will be fixed and will be provided in the function.
3. Note that the nodes in a path will appear in a fixed order. For example, 1 2 3 is not the same as 2 1 3.
4. Each path should be returned as a string consisting of nodes in order and separated by a space.
5. The path length may be as small as ‘1’.
``````
Detailed explanation ( Input/output format, Notes, Images )
Constraints :
``````1 <= T <= 10^2
1 <= N <= 3*10^3

Time Limit : 1 sec
``````
##### Sample Input 1 :
``````2
9
3 5 1 6 2 0 8 -1 -1 7 4 -1 -1 -1 -1 -1 -1 -1 -1
5
1 2 3 4 5 -1 -1 -1 -1 -1 -1
``````
##### Sample Output 1 :
``````3 5 6
3 1 0
3 1 8
3 5 2 7
3 5 2 4
1 3
1 2 4
1 2 5
``````

#### Explanation for Sample Input 1:

``````Test Case 1:
``````

``````Here root is 3 and 6, 7, 4, 0, 8 are leaf nodes
Path from 3 to 6 is 3 5 6
Path from 3 to 7 is 3 5 2 7
Path from 3 to 4 is 3 5 2 4
Path from 3 to 0 is 3 1 0
Path from 3 to 8 is 3 1 8

Test Case 2:
``````

``````Here root is 1 and 4, 5 are leaf nodes
Path from 1 to 4 is 1 2 4
Path from 1 to 5 is 1 2 5
``````
##### Sample Input 2 :
``````1
7
1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1
``````
##### Sample Output 2 :
``````1 3 5
1 3 6
1 2 4 7
``````
Console