"""This question was asked by Google.

This problem was asked by Google.
Given a binary tree of integers, find the maximum path sum between two nodes. 
The path must go through at least one node, and does not need to go through the root.
"""
"""This question was asked by Google.

This problem was asked by Google.
Given a binary tree of integers, find the maximum path sum between two nodes. 
The path must go through at least one node, and does not need to go through the root.
"""
This question was asked by Google.  This problem was asked by Google. Given a binary tree of integers, find the maximum path sum between two nodes.  The path must go through at least one node, and does not need to go through the root.