Replace Values With Depth
You are given the root of a binary tree. Change the value of every node to its depth (the root has depth 0, its children depth 1, and so on). 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 [7,3,9,1]
returns [0,1,1,2]
Depths: 7 is 0; 3 and 9 are 1; 1 is 2. The result is [0,1,1,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.
More Trees problems
- Search Path in a BSTBeginner
- Search in a Binary Search TreeBeginner
- Smallest and Largest in a BSTBeginner
- Sum of All Node ValuesBeginner
- Total Nodes in a Binary TreeBeginner
- Univalued Binary TreeBeginner
- Values at Depth KBeginner
- Average of Levels in Binary TreeEasy