-
Notifications
You must be signed in to change notification settings - Fork 0
/
1339 Maximum Product of Splitted Binary Tree.c
49 lines (38 loc) · 1.25 KB
/
1339 Maximum Product of Splitted Binary Tree.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
long long int traversal(struct TreeNode * root, long long * max_val, long long total_sum)
{
if(root == NULL)
return 0;
long long int left = traversal(root->left, max_val, total_sum);
long long int right = traversal(root->right, max_val, total_sum);
long long int product1 = ((left + root->val + (total_sum - left - right - root->val))) * right ;
long long int product2 = (right + root->val + (total_sum - right - left - root->val) ) * left;
long long max_product = product1 >= product2 ? product1 : product2;
if(max_product >= *max_val)
{
*max_val = max_product;
}
return (left + right + root->val);
}
long long find_sum(struct TreeNode * root)
{
if(root == NULL)
return 0;
long long left = find_sum(root->left);
long long right = find_sum(root->right);
return (left + right + root->val);
}
int maxProduct(struct TreeNode* root)
{
long long max_val = INT_MIN;
long long total_sum = find_sum(root);
traversal(root, &max_val, total_sum);
return max_val % ((int)pow(10, 9) + 7);
}