Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Equal Sum Grid Partition I
Coding
- Equal Sum Grid Partition II
Coding
- Make Costs of Paths Equal in a Binary Tree
Coding
- Minimum Substring Partition of Equal Character Frequency
Coding · Counting · Dynamic Programming · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 663. Equal Tree Partition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source