LeetCode - Binary Tree Maximum Path Sum

Click here to go back to LeetCode summary page.

Problem description is here, or as follows:

Given a binary tree, find the maximum path sum.

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

For example:
Given the below binary tree,

       1
      / \
     2   3

Return 6. 

• Solution 1: Python

This one is tricky and hard.