Replace Values With Subtree Sums
You are given the root of a binary tree. Change the value of every node to the sum of all the values in its subtree (the node itself and all of its descendants), using the original values. Keep the shape of the tree. Return the root.
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]
returns [6,2,3]
The root becomes 1+2+3 = 6; the leaves keep their values: [6,2,3].
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.