(二叉树05) 找树左下角的值 路径总和

一、找树左下角的值

力扣第513题

（递归）前序遍历：（前中后都可以，只要优先访问左就没问题）

class Solution {
    int result = 0;
    int maxDepth = 0;
    public int findBottomLeftValue(TreeNode root) {
        getDepth(root, 1);
        return result;
    }
    public void getDepth(TreeNode root, int depth){
        if(root == null) return;
        
        if(depth > maxDepth) {
            maxDepth = depth;
            result = root.val;
        }

        getDepth(root.left, depth + 1);
        getDepth(root.right, depth + 1);
    }
}

（迭代）层序遍历：

class Solution {
    public int findBottomLeftValue(TreeNode root) {
        if(root == null) return 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int leftFirst = 0;
        while(!queue.isEmpty()) {
            int len = queue.size();
            leftFirst = queue.peek().val;
            for(int i = 0; i < len; i++) {
                TreeNode node = queue.poll();
                if(node.left != null) {
                    queue.offer(node.left);
                }
                if(node.right != null) {
                    queue.offer(node.right);
                }
            } 
        }
        return leftFirst;
    }
}

二、路径总和

力扣第112题：

（递归）代码如下：

class Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root == null) {
            return false;
        } 
        if(root.left == null && root.right == null && root.val == targetSum) {
            return true;
        }
    
        boolean left = hasPathSum(root.left, targetSum -root.val);
        boolean right = hasPathSum(root.right, targetSum -root.val);
        return left || right;
    }
}