Leetcode Problem 663. Equal Tree Partition

663. Equal Tree Partition

Leetcode Solutions

Define a helper function to perform DFS on the tree and calculate the sum of each subtree.
During DFS, store the sum of each subtree in a set or list.
After DFS, check if the total sum of the tree is even, as an odd sum cannot be split into two equal parts.
If the sum is even, check if half of the total sum exists in the set or list of subtree sums (excluding the total sum itself).
If such a value exists, return true; otherwise, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen