codingQuestions/DeepestLeavesSum.java at main · chanda1998/codingQuestions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
import java.util.LinkedList;
import java.util.Queue;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class DeepestLeavesSum {
    public int deepestLeavesSum(TreeNode root) {
        if(root.left ==null && root.right == null) return root.val;
        int sum = 0;
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        while(q.size() > 0){
            boolean isLeaf = true;
            int siz = q.size();
            for(int i = 0; i < siz; i++){
                TreeNode cur = q.poll();
                if(cur.right != null){
                    q.offer(cur.right);
                    if(cur.right.right == null && cur.right.left == null) {
                        sum += cur.right.val;
                    }else isLeaf = false;
                }
                if(cur.left != null){
                    q.offer(cur.left);
                    if(cur.left.left == null && cur.left.right == null){
                        sum += cur.left.val;
                    }else isLeaf = false;
                }
            }
            if(isLeaf) return sum;
            sum = 0;
        }

        return sum;
    }
}