Available question text
Given a binary tree with exactly three nodes (a root and its left and right children), determine whether the root's value equals the sum of its two children's values. This is a constant-time check comparing root.val to left.val + right.val.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
Coding
- Maximum Size Subarray Sum Equals k
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
- Subarray Sum Equals K
Coding · Array · Hash Table · Prefix Sum
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 2236. Root Equals Sum of Children
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source