算法跟学Day15 【代码随想录】

第六章 二叉树02

大纲

• 层序遍历
• 翻转二叉树
• 对称二叉树

leetcode 102 层序遍历

思路

• 递归法逐层遍历
• 迭代法队列求解

细节

• 注意迭代法时候需要借助二叉树深度来控制返回结果中的集合个数

代码

class Solution {
    List<List<Integer>> res = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        if (root == null) return res;
        order(root, 0);
        return res;
    }

    public void order(TreeNode node, int depth) {
        if (node == null) return;
        if (res.size() < ++depth) res.add(new ArrayList<Integer>());
        res.get(depth - 1).add(node.val);
        order(node.left, depth);
        order(node.right, depth);
    }
}

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new ArrayList<>();
        if (root == null) return res;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            List<Integer> item = new ArrayList<>();
            while (size-- > 0) {
                TreeNode node = queue.poll();
                item.add(node.val);
                if (node.left != null) queue.offer(node.left);
                if (node.right != null) queue.offer(node.right);
            }
            res.add(item);
        }
        return res;
    }
}

复杂度

• 时间 O(n)
• 空间 O(n)

leetcode 226 翻转二叉树

思路

• 递归法交换左右孩子再分别迭代
• 迭代法

代码

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) return null;
        TreeNode tmp = root.left;
        root.left = root.right;
        root.right = tmp;
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }
}

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) return null;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            while (size-- > 0) {
                TreeNode node = queue.poll();
                TreeNode tmp = node.left;
                node.left = node.right;
                node.right = tmp;
                if (node.left != null) queue.offer(node.left);
                if (node.right != null) queue.offer(node.right);
            }           
        }
        return root;
    }
}

复杂度

• 时间 O(n)
• 空间 O(n)

leetcode 101 对称二叉树

思路

• 递归直接镜像判断
• 迭代使用队列按镜像位置存放元素同时取两个判断

代码

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) return true;
        return compare(root.left, root.right);
    }

    public boolean compare(TreeNode left, TreeNode right) {
        if (left == null && right == null) return true;
        if (left == null || right == null) return false;
        return left.val == right.val && compare(left.left, right.right) && compare(left.right, right.left);
    }
}

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) return true;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root.left);
        queue.offer(root.right);
        while (!queue.isEmpty()) {
            TreeNode left = queue.poll(), right = queue.poll();
            if (left == null && right == null) continue;
            if (left == null || right == null || left.val != right.val) return false;
            queue.offer(left.left);
            queue.offer(right.right);
            queue.offer(left.right);
            queue.offer(right.left);
        }
        return true;
    }
}

复杂度

• 时间 O(n)
• 空间 O(n)