Binary Tree Maximum Path Sum · Coding Interview Practice

Binary Tree Maximum Path SumGiven the root of a binary tree, return the maximum path sum of any non-empty path (need not pass through the root).Constraints

The number of nodes is in the range [1, 3 * 10^4]

-1000 <= Node.val <= 1000

Examples

Input: root = [1,2,3] Output: 6

Input: root = [-10,9,20,null,null,15,7] Output: 42

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…