二叉树练习 513.找树左下角的值 112. 路径总和 113. 路径总和ii

513.找树左下角的值

/**
 * 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 Solution {
    public int res = 0;
    public int findBottomLeftValue(TreeNode root) {
        bfs(root);
        return res;
    }

    public void bfs(TreeNode root){
        Queue<TreeNode> que = new LinkedList<>();
        que.offer(root);
        while(!que.isEmpty()){
            int size = que.size();
            res = que.peek().val;
            while(size > 0){
                TreeNode temp = que.poll();
                if(temp.left != null){
                    que.add(temp.left);
                } 
                if(temp.right != null){
                    que.add(temp.right);
                } 
                size--;
            }
        }
    }
}

112. 路径总和

给你二叉树的根节点 root 和一个表示目标和的整数 targetSum 。判断该树中是否存在 根节点到叶子节点 的路径，这条路径上所有节点值相加等于目标和 targetSum 。如果存在，返回 true ；否则，返回 false 。

叶子节点 是指没有子节点的节点。

示例 1：

输入：root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
输出：true
解释：等于目标和的根节点到叶节点路径如上图所示。

/**
 * 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 Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root == null) return false;
        targetSum -= root.val;
        if(root.left == null && root.right == null){
            return targetSum == 0;
        } 
        if(root.left != null){
            if(hasPathSum(root.left, targetSum)){
                return true;
            }
        }
        if(root.right != null){
            if(hasPathSum(root.right, targetSum)){
                return true;
            }
        }
        return false;
    }
}

113. 路径总和ii  

给你二叉树的根节点 root 和一个整数目标和 targetSum ，找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。

叶子节点 是指没有子节点的节点。

示例 1：

输入：root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出：[[5,4,11,2],[5,8,4,5]]

/**
 * 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 Solution {
    public List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<Integer> temp = new ArrayList<>();
        traversal(root, targetSum, temp);
        return res;
    }

    public void traversal(TreeNode root, int targetSum, List<Integer> temp){
        if(root == null) return;
        targetSum -= root.val;
        temp.add(root.val);
        if(root.left == null && root.right == null){
            if(targetSum == 0){
                res.add(new ArrayList<>(temp));
            }else{
                return;
            }
        }
        if(root.left != null){
            traversal(root.left, targetSum, temp);
            temp.remove(temp.size() - 1);
        }
        if(root.right != null){
            traversal(root.right, targetSum, temp);
            temp.remove(temp.size() - 1);
        }
    }
}