# Binary Tree Maximum Path Sum II

{% embed url="<https://www.lintcode.com/problem/475/>" %}

## Solution

See [Binary Tree Maximum Path Sum II](https://blog.yushunchen.com/algo/binary-tree/4.-divide-and-conquer/binary-tree-maximum-path-sum-ii) in the binary tree chapter.
