video1.0<iframe src="https://www.loom.com/embed/c17cd6b7d58a47f38995aa371c6b6c10" frameborder="0" width="1920" height="1440" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>14401920Loomhttps://www.loom.com14401920https://cdn.loom.com/sessions/thumbnails/c17cd6b7d58a47f38995aa371c6b6c10-00001.gif112.203In this video, I explain how to solve the problem of finding the maximum sum path in binary trees. I discuss the steps involved, including finding the left and right maximum sums, considering positive and negative paths, and returning the maximum sum with the root. I also highlight the importance of not including negative paths in the maximum sum. This video provides a clear explanation of the concept and offers a practical approach to solving the problem. No action is requested from the viewers.