Max Sum Path in Binary Tree

Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

Example :

Given the below binary tree,

      / \
     2   3

Return 6.

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Max Sum Path in Binary Tree on Interview Code Editor
Sign Up
to access hints and editorial solutions for Max Sum Path in Binary Tree
Asked In:


Click here to start solving coding interview questions