binary_tree_maximum_path_sum

README

< Previous 　　　　　　　　　　　　　　　　 Next >

124. Binary Tree Maximum Path Sum (Hard)

Given a non-empty binary tree, find the maximum path sum.

For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.

Example 1:

Input: [1,2,3]

       1
      / \
     2   3

Output: 6

Example 2:

Input: [-10,9,20,null,null,15,7]

   -10
   / \
  9  20
    /  \
   15   7

Output: 42

Related Topics

[Tree] [Depth-first Search]

Similar Questions

1. Path Sum (Easy)
2. Sum Root to Leaf Numbers (Medium)
3. Path Sum IV (Medium)
4. Longest Univalue Path (Easy)