Leetcode 124 二叉树中的最大路径和 Binary Tree Maximum Path Sum | Tree | Recursive | Post-order
Synopsis
Leetcode 124 解题思路： 从中间node状态开始思考。 每一层向上返回当前的single path sum，共三种情况1. leftMax + node.val 2.
You Might Also Like
![[LeetCode]124. Binary Tree Maximum Path Sum 中文](https://i.ytimg.com/vi/LUWuPSKksCE/hq720.jpg?sqp=-oaymwEcCNAFEJQDSFXyq4qpAw4IARUAAIhCGAFwAcABBg==&rs=AOn4CLCWN1SBex9TB_Bchk6bqA5VyVUFXA)
![[Leetcode] 124. Binary Tree Maximum Path Sum 中文解說 - Python](https://i.ytimg.com/vi/mMJQSL1iHnY/hq720.jpg?sqp=-oaymwEcCNAFEJQDSFXyq4qpAw4IARUAAIhCGAFwAcABBg==&rs=AOn4CLC_N_xw63jqe5KzEbPZgbAT8fR3uA)
Download Options
Choose a download method below. All links open in new tabs.
| Service | Features | Action |
|---|---|---|
| SaveFrom |
MP4 & MP3 • HD Quality • Browser Extension Available
|
Download |
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.