LeetCode 1339: Maximum Product of Splitted Binary Tree Solution

Master LeetCode problem 1339 (Maximum Product of Splitted Binary Tree), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1339. Maximum Product of Splitted Binary Tree

Medium

Tree Depth-First Search Binary Tree

Problem Explanation

Explanation:

To solve this problem, we can traverse the binary tree in a post-order manner. For each node, we calculate the total sum of the subtree rooted at that node, and then check the product of the two subtrees after removing the edge above the current node. We keep track of the maximum product found so far.

Traverse the binary tree in post-order to calculate the total sum of each subtree.
For each node, calculate the total sum of the subtree rooted at that node.
For each node, calculate the product of the two subtrees after removing the edge above the current node.
Keep track of the maximum product found so far.
Return the maximum product modulo 10^9 + 7.

Time Complexity: O(N), where N is the number of nodes in the binary tree. Space Complexity: O(N), for the recursive stack space.

Solution Code

class Solution {
    private long totalSum = 0;
    private long maxProduct = 0;

    public int maxProduct(TreeNode root) {
        totalSum = calculateSum(root);
        calculateProduct(root);
        return (int)(maxProduct % (int)(1e9 + 7));
    }

    private long calculateSum(TreeNode node) {
        if (node == null) return 0;
        long sum = node.val + calculateSum(node.left) + calculateSum(node.right);
        return sum;
    }

    private long calculateProduct(TreeNode node) {
        if (node == null) return 0;
        long sum = node.val + calculateProduct(node.left) + calculateProduct(node.right);
        maxProduct = Math.max(maxProduct, sum * (totalSum - sum));
        return sum;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1339 (Maximum Product of Splitted Binary Tree)?

This page provides optimized solutions for LeetCode problem 1339 (Maximum Product of Splitted Binary Tree) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1339 (Maximum Product of Splitted Binary Tree)?

The time complexity for LeetCode 1339 (Maximum Product of Splitted Binary Tree) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1339 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1339 in Java, C++, or Python.

Back to LeetCode Solutions