Nodes Equal to Sum of Children
You are given the root of a binary tree. Count the nodes that have at least one child and whose value equals the sum of their children's values (a missing child counts as 0). Leaves are not counted. An empty tree gives 0.
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [10,4,6]
returns 1
10 = 4 + 6, so the root counts.
Constraints
0 <= number of nodes <= 100-100 <= node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.