Root to Leaf Paths | Practice

Problem
Contest

Here is some troubleshooting advice:

Reset the IDE using the second button on the top right corner.
Avoid using static/global variables in your code as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.
You can access the hints to get an idea about what is expected of you as well as the final solution code.
You can view the solutions submitted by other users from the submission tab.

Still facing issue? Click here.

Here is some troubleshooting advice for contest problems

Make sure you are not using ad-blockers.
Disable browser extensions.
We recommend using latest version of your browser for best experience.
Avoid using static/global variables in coding problems as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases in coding problems does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.

Still facing issue? Click here.

Suggest Changes in Problem Statement:

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:

<pre>
Input:
 1
 / \
 2 3
Output: 1 2 #1 3 #
Explanation: 
All possible paths:
1->2
1->3

</pre>

Example 2:

<pre>
Input:
  10
  / \
  20 30
  / \
  40 60
Output: 10 20 40 #10 20 60 #10 30 #

</pre>

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 
java: ArrayList> 
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.

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:

<pre>
Input:
 1
 / \
 2 3
Output: 1 2 #1 3 #
Explanation: 
All possible paths:
1->2
1->3

</pre>

Example 2:

<pre>
Input:
  10
  / \
  20 30
  / \
  40 60
Output: 10 20 40 #10 20 60 #10 30 #

</pre>

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 
java: ArrayList> 
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.

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Message

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Select Operation Mode