Binary Tree Maximum Path Sum

[DeeptiShahi]

Problem Statement : Given the root of a Binary Tree, return the maximum path sum of any path. Path Sum is the sum of node values along a path.

Input : Root Node Object
Output : Integer value
-1000 <= Node.val <= 1000

Example

Input : [1, 2, 3, 4]
Output : 10

Approach : I have worked on this problem before using simple recursion and would like to contribute the same to this repository. Please assign this issue to me!

[siriak]

[1, 2, 3, 4] is not a path because there's no edge between 2 and 3

[DeeptiShahi]

The path here is 2->1->3->4 which results in 10. Path can be from any node to any node.

[siriak]

So what is actually an input? Root node or path?

[DeeptiShahi]

Input is Root node, which will be node object with value 1.
I have written the preorder list of this tree in input just to show the tree formed with the root node. Input will not look like this.

[ungatz]

heya, can you assign this to me?

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!