[LeetCode] 1339. 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 max