Given a binary tree, find the maximum path sum.
The path may start and end at any node in the tree.
Given the below binary tree,
1 / \ 2 3
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.