BINARY TREE MAX PATH SUM | PYTHON | LEETCODE 124

In this video we are solving Leetcode Problem # 124: Binary Tree Max Path Sum. Despite being labeled as a Hard level problem, it's a relatively simple post order traversal with just a few edge cases to consider due to negative values in the tree.

[@yogeshsrikanth5660]

Wonderfully explained! Keep this going!!

[@ajajajaj686]

It can be solved with more clarity knowing that the gain from each left or right could be the max of that branch and zero to automatically exclude negative gains.

[@SriHarshaBolisetti]

Thank you for your wonderful explanations!!

[@crackfaang]

Thank you for your kind words! Make sure to subscribe so you don’t miss future videos

[@SriHarshaBolisetti]

@@crackfaang already did long back :D

[@sadafsadafi4290]

excellent!