Maximum Path Sum Of Binary Tree

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a partially written function to solve.

2. You are required to complete the body of maxPathSum function. The function is expected to return Integer value depending upon node-to-node paths where path sum equals targetSum.

3. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

4. The path sum of a path is the sum of the node's values in the path.
Input Format
Input is managed for you.
Output Format
Output is managed for you.
Question Video
Constraints
0 <= Number of Nodes <= 10^9
-10^9 <= value of Node data <= 10^9
Sample Input
7
1
2
-1
-1
3
-1
-1
Sample Output
6


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name