Time: 53 ms (73.00%) | Memory: 48.3 MB (5.32%) - LeetSync

Author: joshua-dierickse-alt

1465-maximum-product-of-splitted-binary-tree/maximum-product-of-splitted-binary-tree.py

@@ -0,0 +1,33 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+
+def nodesToSum(node):
+    if not node:
+        return 0
+    node.sum = nodesToSum(node.left) + node.val + nodesToSum(node.right)
+    return node.sum
+
+def leftSplit(node):
+    return (s - node.left.sum) * node.left.sum
+
+def rightSplit(node):
+    return (s - node.right.sum) * node.right.sum
+
+def getMaxSplit(node):
+    return max(max(leftSplit(node), getMaxSplit(node.left)) if node.left else 0,
+               max(rightSplit(node), getMaxSplit(node.right)) if node.right else 0)
+
+s = None
+
+class Solution:
+    def maxProduct(self, root: Optional[TreeNode]) -> int:
+        global s
+
+        nodesToSum(root)
+        s = root.sum
+        return getMaxSplit(root) % (10**9+7)
+