Leetcode 663. Equal Tree Partition
Given a binary tree with integer node values, determine whether removing a single edge can split it into two trees whose node-value sums are equal by checking if any proper subtree has sum equal to half the total (handle the total-zero case appropriately).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.