LeetCode 0124  Binary Tree Maximum Path Sum
Binary Tree Maximum Path Sum
Desicription
Given a 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 parentchild connections. The path must contain at least one node and does not need to go through the root.
For example:
Given the below binary tree,


Return 6
.
Solution

