代码随想录day16：二叉树part5，路径总和（回溯），中序+前/后序构造二叉树

day16：二叉树part5，路径总和&构造

513.找树左下角的值

层序遍历模板题

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

112.路径总和

class Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null) return false;
        int curTargetSum = targetSum - root.val;
        // 叶子节点
        if (root.left == null && root.right == null)
            return curTargetSum == 0;
        // 左右
        if (root.left != null) {
            if (hasPathSum(root.left, curTargetSum))
                return true;
        }
        if (root.right != null) {
            if (hasPathSum(root.right, curTargetSum))
                return true;
        }
        return false;
    }
}

113.路径总和 II

class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> ans = new ArrayList<>();
        if (root == null) return ans;
        List<Integer> path = new ArrayList<>();
        getPath(root, targetSum, ans, path);
        return ans;
    }
    public void getPath(TreeNode root, int targetSum, List<List<Integer>> ans, List<Integer> path) {
        path.add(root.val);
        int curTargetSum = targetSum - root.val;
        // 叶子节点
        if (root.left == null && root.right == null && curTargetSum == 0)
            ans.add(new ArrayList<Integer>(path));
        // 左右
        if (root.left != null) {
            getPath(root.left, curTargetSum, ans, path);
            path.remove(path.size() - 1);
        }
        if (root.right != null) {
            getPath(root.right, curTargetSum, ans, path);
            path.remove(path.size() - 1);
        }
    }
}

106.从中序与后序遍历序列构造二叉树

class Solution {
    Map<Integer, Integer> map;
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        map = new HashMap<>();
        // map保存中序数组中index索引
        for (int i = 0; i < inorder.length; i++) {
            map.put(inorder[i], i);
        }
        return buildNode(inorder, 0, inorder.length, postorder, 0, postorder.length);
    }
    public TreeNode buildNode(int[] inorder, int inBegin, int inEnd, int[] postorder, int postBegin, int postEnd) {
        if (inBegin >= inEnd || postBegin >= postEnd) return null;
        // 找中序数组中根节点位置
        int inRoot = map.get(postorder[postEnd - 1]);
        // 根节点
        TreeNode root = new TreeNode(inorder[inRoot]);
        int lenOfLeft = inRoot - inBegin;
        // 左右子树
        root.left = buildNode(inorder, inBegin, inRoot, postorder, postBegin, postBegin + lenOfLeft);
        root.right = buildNode(inorder, inRoot + 1, inEnd, postorder, postBegin + lenOfLeft, postEnd - 1);
        return root;
    }
}

105.从前序与中序遍历序列构造二叉树

class Solution {
    Map<Integer, Integer> map;
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        map = new HashMap<>();
        for (int i = 0; i < inorder.length; i++)
            map.put(inorder[i], i);
        return build(preorder, 0, preorder.length, inorder, 0, inorder.length);
    }
    public TreeNode build(int[] preorder, int preBegin, int preEnd, int[] inorder, int inBegin, int inEnd) {
        if (preBegin >= preEnd || inBegin >= inEnd) return null;
        int inRoot = map.get(preorder[preBegin]);
        int lenOfLeft = inRoot - inBegin;
        TreeNode root = new TreeNode(inorder[inRoot]);
        root.left = build(preorder, preBegin + 1, preBegin + 1 + lenOfLeft, inorder, inBegin, inRoot);
        root.right = build(preorder, preBegin + 1 + lenOfLeft, preEnd, inorder, inRoot + 1, inEnd);
        return root;
    }
}