Practice Maximum Product of Splitted Binary Tree

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1339

LeetCode Problem

Maximum Product of Splitted Binary Tree

Tree Depth-First Search Binary Tree

Problem Statement

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 10^9 + 7. Note that you need to maximize the answer before taking the mod and not after taking it.

Source: Maximum Product of Splitted Binary Tree on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

root = [1,2,3,4,5,6]

Output

# Example 2

Input

root = [1,null,2,3,4,null,null,5,6]

Output

Constraints

The number of nodes in the tree is in the range [2, 5 * 10^4].

1 <= Node.val <= 10^4

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free