Given a Binary Tree of size N, you need to find all the possible paths from root node to all the leaf node's of the binary tree.
Example 1:
Input:
1
/ \
2 3
Output: 1 2 #1 3 #
Explanation:
All possible paths:
1->2
1->3
Example 2:
Input:
10
/ \
20 30
/ \
40 60
Output: 10 20 40 #10 20 60 #10 30 #
Your Task:
Your task is to complete the function Paths() that takes the root node as an argument and return all the possible path. (All the path are printed '#' separated by the driver's code.)
Note: The return type
cpp: vector<vector<int>
java: ArrayList<ArrayList<Integer>>
python: list of list
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(H).
Note: H is the height of the tree.
Constraints:
1<=N<=103
Note: The Input/Ouput format and Example given, are used for the system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from the stdin/console. The task is to complete the function specified, and not to write the full code.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| jainshubham52535 | 529 |
| Pathak1899 | 436 |
| yashdip123 | 380 |
| kirtidee18 | 377 |
| jots62 | 351 |
| kirtidee18 | 1057 |
| ykaushik | 752 |
| aggarwalvatsal5 | 741 |
| harbilassingh | 576 |
| pmr_3689 | 570 |
| blackshadows | 5456 |
| Ibrahim Nash | 5450 |
| akhayrutdinov | 5111 |
| mb1973 | 4976 |
| Quandray | 4827 |
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
1 3 2
Input Format:
The tree in the input is given in the form of a string as described below.
The values in the string are in the order of level order traversal of the tree where, numbers denotes node values, and a character “N” denotes NULL child.
For example:
For the above tree, the string will be: 1 2 3 N N 4 6 N 5 N N 7 N
Example:
1 3 2