Given the root of a binary tree, return the sum of values of its deepest leaves.
Example 1:
Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15
Example 2:
Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5] Output: 19
Constraints:
[1, 104].1 <= Node.val <= 100
class Solution {
int ans = 0 ;
public int height(TreeNode root ){
if(root == null){
return 0 ;
}
int lh = height(root.left );
int rh = height(root.right);
return Math.max(lh,rh) +1 ;
}
public int deepestLeavesSum(TreeNode root) {
int h = height(root);
helper(root , h);
return ans ;
}
public void helper(TreeNode root , int height ){
if(root == null){
return ;
}
if(height == 1){
ans = ans + root.val;
}
helper(root.left , height-1);
helper(root.right , height-1);
}
}
Office:- 660, Sector 14A, Vasundhara, Ghaziabad, Uttar Pradesh - 201012, India
