Given a binary tree, find the maximum path sum from root. The path may end at any node in the tree and contain at least one node in it.