Solving Binary Tree Maximum Path Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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

See the full details of the problem Binary Tree Maximum Path Sum at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go