代码随想录算法训练营第十五天| LeetCode102 层序遍历 、LeetCode226 翻转二叉树、LeetCode101 对称二叉树

LeetCode102 层序遍历

题目链接：https://programmercarl.com/0102.%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86.html代码：

// 迭代方式层序遍历
public class code102 {
    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 currentLevelSize = queue.size();   // 当前层的节点数量

            List<Integer> list = new ArrayList<>();

            while (currentLevelSize > 0) {
                TreeNode node = new TreeNode();
                node = queue.poll();
                list.add(node.val);
                if (node.left != null) {
                    queue.offer(node.left);
                }
                if (node.right != null) {
                    queue.offer(node.right);
                }
                currentLevelSize--;
            }
            res.add(list);
        }
        return res;
    }
}

通过一个辅助队列去遍历二叉树

LeetCode226 翻转二叉树

题目链接：https://programmercarl.com/0226.%E7%BF%BB%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91.html代码：

public class code226 {
    public TreeNode invertTree(TreeNode root) {

        if (root == null) {
            return root;
        }
        swap(root);
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }

    private void swap(TreeNode node) {
        TreeNode t = node.left;
        node.left = node.right;
        node.right = t;
    }
}

注意理解为什么中序遍历不能套用这个代码

LeetCode101 对称二叉树

题目链接：https://programmercarl.com/0101.%E5%AF%B9%E7%A7%B0%E4%BA%8C%E5%8F%89%E6%A0%91.html代码：

public class code101 {
    public boolean isSymmetric(TreeNode root) {

        return compare(root.left, root.right);
    }

    private boolean compare(TreeNode left, TreeNode right) {

        if (left == null && right != null) {
            return false;
        }
        if (left != null && right == null) {
            return false;
        }
        if (left == null && right == null) {
            return true;
        }
        if (left.val != right.val) {
            return false;
        }
        // 比较外侧
        boolean compareOut = compare(left.left, right.right);
        // 比较内侧
        boolean compareIn = compare(left.right, right.left);
        return compareOut && compareIn;
    }

}