LeetCode42|层数最深叶子节点的和

输入：root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
输出：15
 

提示：

树中节点数目在 1 到 10^4 之间。
每个节点的值在 1 到 100 之间。

package com.wpw.niuketest;

import java.util.LinkedList;
import java.util.Queue;

public class DeepestLeaveSumTest {
    public static void main(String[] args) {
        TreeNode t1=new TreeNode(1);
        TreeNode t2=new TreeNode(2);
        TreeNode t3=new TreeNode(3);
        TreeNode t4=new TreeNode(4);
        TreeNode t5=new TreeNode(5);
        TreeNode t6=new TreeNode(6);
        TreeNode t7=new TreeNode(7);
        TreeNode t8=new TreeNode(8);
        t1.left=t2;
        t1.right=t3;
        t2.left=t4;
        t2.right=t5;
        t3.right=t6;
        t4.left=t7;
        t6.right=t8;
        int leaveSum = deepestLeaveSum(t1);
        System.out.println("leaveSum = " + leaveSum);

    }

    public static  int deepestLeaveSum(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int result = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            int currLevelValue = 0;
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                currLevelValue += node.val;
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
            result = currLevelValue;
        }
        return result;
    }
}