Leetcode Problem 1339. Maximum Product of Splitted Binary Tree

1339. Maximum Product of Splitted Binary Tree

Leetcode Solutions

Define a recursive function tree_sum that calculates the sum of a subtree rooted at a given node.
In tree_sum, calculate the sum of the left and right subtrees recursively.
Add the value of the current node to the sum of its left and right subtrees to get the total sum of the current subtree.
Append the sum of the current subtree to a list of subtree sums.
After the DFS, calculate the total sum of the entire tree.
Iterate through the list of subtree sums to calculate the product of each subtree sum with the sum of the remaining tree.
Keep track of the maximum product found during the iteration.
Return the maximum product modulo 10^9 + 7.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen