2121.9.2刷题

 二叉树的最小深度
class Solution {
    public int minDepth(TreeNode root) {
        int ans=1000000;
        if(root==null) return 0;
        if(root.left==null)
        {
            return minDepth(root.right)+1;
        }
        if(root.right==null)
        {
            return minDepth(root.left)+1;
        }
        ans=Math.min(minDepth(root.left)+1,minDepth(root.right)+1);
        return ans;
    }
}

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

    }
}

路径总合Ⅱ
class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        if(root==null) return new ArrayList<>();
        List<List<Integer>> sum=new ArrayList<>();
        if(root.left==null&&root.right==null)
        {
            if(targetSum-root.val==0)
            {
                List<Integer> x=new ArrayList<>();
                x.add(root.val);
                sum.add(x);
                return sum;
            }
        }
        List<List<Integer>> left = pathSum(root.left,targetSum-root.val);
        List<List<Integer>> right = pathSum(root.right,targetSum-root.val);
        for(List<Integer> list : left){
           list.add(0,root.val);
           sum.add(list);
        }
        for(List<Integer> list : right){
           list.add(0,root.val);
           sum.add(list);
        }
        return sum;
    }
}

二叉树展开为链表
class Solution {
    public void flatten(TreeNode root) {
        if(root==null) return;
        TreeNode x,y;
        flatten(root.left);
        flatten(root.right);
        TreeNode tmp = root.right;
        root.right = root.left;
        root.left = null;
        while(root.right != null) root = root.right;
        root.right = tmp;
    }
}
 填充每个节点的下一个右侧节点指针
class Solution {
    public Node connect(Node root) {
        if(root==null||root.right==null) return root;
        root.left.next=root.right;
        if(root.next!=null)
        {
            root.right.next=root.next.left;
        }
        connect(root.left);
        connect(root.right);
        return root;
    }
    
}