# 1339. Maximum Product of Splitted Binary Tree

Given the `root` of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is maximized.

Return the maximum product of the sums of the two subtrees. Since the answer may be too large, return it modulo `109 + 7`.

Note that you need to maximize the answer before taking the mod and not after taking it.

Example 1:

Input: root = [1,2,3,4,5,6]
Output: 110
Explanation: Remove the red edge and get 2 binary trees with sum 11 and 10. Their product is 110 (11*10)

Example 2:

Input: root = [1,null,2,3,4,null,null,5,6]
Output: 90
Explanation: Remove the red edge and get 2 binary trees with sum 15 and 6.Their product is 90 (15*6)

Constraints:

• The number of nodes in the tree is in the range `[2, 5 * 104]`.
• `1 <= Node.val <= 104`

``````class Solution {
public:
int maxProduct(TreeNode* root) {
long res = 0, sum = 0, M = 1e9 + 7;
dfs(root, sum);
helper(root, sum, res);
return res % M;
}
void dfs(TreeNode* node, long& sum) {
if (!node) return;
sum += node->val;
dfs(node->left, sum);
dfs(node->right, sum);
}
int helper(TreeNode* node, long sum, long& res) {
if (!node) return 0;
int cur = node->val + helper(node->left, sum, res) + helper(node->right, sum, res);
res = max(res, cur * (sum - cur));
return cur;
}
};
``````

``````class Solution {
public:
int maxProduct(TreeNode* root) {
long res = 0, sum = 0, M = 1e9 + 7;
sum = dfs(root, sum, res);
dfs(root, sum, res);
return res % M;
}
int dfs(TreeNode* node, long sum, long& res) {
if (!node) return 0;
int cur = node->val + dfs(node->left, sum, res) + dfs(node->right, sum, res);
res = max(res, cur * (sum - cur));
return cur;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1339

Count Nodes With the Highest Score

https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/

https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/solutions/496496/java-two-pass-postorder-traversal/

https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/solutions/496549/java-c-python-easy-and-concise/

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation