LeetCode 124 Binary Tree Maximum Path Sum

LeetCode 124 Binary Tree Maximum Path Sum Problem

Download Code
# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def __init__(self):
        self.result = -2147483647

    def maxPathSum(self, root):
        :type root: TreeNode
        :rtype: int
        # return (root.val,left+root.val,right+root.val,left+right+root);
        return self.result

    def getNodeMaxValue(self, node):
        if node is None:
            return 0
        lresult = self.getNodeMaxValue(node.left)
        rresult = self.getNodeMaxValue(node.right)
        self.result = max(lresult + rresult + node.val, self.result)
        ret = node.val + max(lresult, rresult)
        # if max left or right < 0 then return 0
        if ret > 0:
            return ret
        return 0
Download Binary Tree Maximum Path Sum.py

List of all Binary Tree Maximum Path Sum problems

Leetcode 124 Binary Tree Maximum Path Sum problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

self.val = x

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.