Maximum Product of Splitted Binary Tree

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 modulo 10^9 + 7.

Ada AI

I want to discuss a solution

Help me solve this

Give more examples

What's wrong with my code?

How to use 'for loop' in javascript?

javascript (node 13.12.0)

Stdin (editable)

Maximum Product of Splitted Binary Tree self.__wrap_b(":R159l76:",1)

Maximum Product of Splitted Binary Tree