Given a binary tree root. Split the binary tree into two subtrees by removing 1 edge such that the product of the sums of the subtrees are maximized.
Since the answer may be too large, return it modulo 10^9 + 7.
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)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */classSolution {public:constunsignedint M =1000000007;long res =0;intsum(TreeNode*node,long total =0) {if (node ==nullptr) return0;int l =sum(node->left, total);int r =sum(node->right, total);constint s = l + r +node->val; res =max(res, s * (total - s));return s; }intmaxProduct(TreeNode* root) {constint total =sum(root);sum(root, total);return res % M; }};