Nodes With Balanced Subtree Sizes
You are given the root of a binary tree. For a node, compare the number of nodes in its left subtree with the number of nodes in its right subtree (a missing child has 0 nodes). Count the nodes where the two numbers are equal. Every leaf counts, since 0 equals 0. 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 [1,2,3,4]
returns 2
Leaves 4 and 3 count. 2 has 1 on the left and 0 on the right: no. The root has 2 on the left and 0 on the right: no. Total 2.
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.