leetcode：1302. 层数最深叶子节点的和

题目来源

1302. 层数最深叶子节点的和

why，一个简单的中序遍历会是中等难度

题目描述

题目解析

 int deepestLeavesSum(TreeNode* root) {
        if(root == NULL){
            return 0;
        }
        
        int ans = 0;
        std::queue<TreeNode *> queue;
        queue.push(root);
        while (!queue.empty()){
            int size = queue.size(), tmp = 0;
            for (int i = 0; i < size; ++i) {
                TreeNode *peek = queue.front();
                queue.pop();
                tmp += peek->val;
                if(peek->left){
                    queue.push(peek->left);
                }
                if(peek->right){
                    queue.push(peek->right);
                }
            }
            ans = tmp;
        }
        
        return ans;
    }

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
private int maxDepth = 0;
    private int ans;
    public int deepestLeavesSum(TreeNode root) {
        if (root == null){
            return 0;
        }

        helper(root, 0);

        return ans;
    }

    private void helper(TreeNode root, int depth){
        if (root.left == null && root.right == null){
            if (depth > maxDepth){
                maxDepth = depth;
                ans  = root.val;
            }else if (depth == maxDepth){
                ans  += root.val;
            }

            return;
        }

        if (root.left != null){
            helper(root.left, depth + 1);
        }

        if (root.right != null){
            helper(root.right, depth + 1);
        }
    }
}