public int maxPathSum(Node root) {
        max = Integer.MIN_VALUE;
        maxPathSumUtil(root);
        return max;
    }
Date 03/22/2016
@author Tushar Roy

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 parent-child connections.

Time complexity O(n)
Space complexity depends on depth of tree.

https://leetcode.com/problems/binary-tree-maximum-path-sum/
src/com/interview/tree/BinaryTreeMaximumPathSum.java