content.md

Given a binary tree, find the maximum path sum.

The path may start and end at any node in the tree.

For example:

Given the below binary tree,

1
      / \
     2 3

Return 6.

Show Tags Tree Depth-first Search