Sum of All Node Values
You are given the root of a binary tree. Return the sum of every value in the tree. An empty tree gives 0. Values can be negative.
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
1 + 2 + 3 - 4 = 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.