> For the complete documentation index, see [llms.txt](https://blog.yushunchen.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://blog.yushunchen.com/algo/bfs/1.-bfs-in-binary-tree/binary-tree-maximum-path-sum-ii.md).

# Binary Tree Maximum Path Sum II

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

## Solution

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