代码随想录Day015 | Leetcode 102.层序遍历 、Leetcode 226.翻转二叉树 、Leetcode 101.对称二叉树

改用递归，熟了就比迭代快，多复习

102.层序遍历

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> res = new LinkedList<>();
        List<Integer> linkedList = new LinkedList<>();
        if (root == null) {
            return res;
        }


        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        TreeNode curEndNode = root;
        TreeNode nextEndNode = null;
        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            if (node.left != null) {
                nextEndNode = node.left;
                queue.add(node.left);
            }
            if (node.right != null) {
                nextEndNode = node.right;
                queue.add(node.right);
            }
            linkedList.add(node.val);

            if (curEndNode == node) {

                res.add(linkedList);
                linkedList = new LinkedList<>();
                curEndNode = nextEndNode;
            }

        }


        return res;
    }
}

226.翻转二叉树

class Solution {
    public TreeNode invertTree(TreeNode root) {

        if (root == null || root.left == null && root.right == null) {
            return root;
        }


        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;

        //此时需要写成invertTree(root.left);
        //而不是invertTree(root);因为需要向左右探测
        invertTree(root.left);
        invertTree(root.right);
        return root;
    }
}

101.对称二叉树

class Solution {
    public boolean isSymmetric(TreeNode root) {

        boolean res = isLeftEqualRifgt(root.left, root.right);
        return res;
    }

    public boolean isLeftEqualRifgt(TreeNode left, TreeNode right) {
        if (left == null && right == null) {
            return true;
        } else if (left != null && right == null || left == null && right != null) {
            return false;
        }

        boolean leftFlag = isLeftEqualRifgt(left.left, right.right);
        boolean rightFlag = isLeftEqualRifgt(left.right, right.left);
        if (left.val != right.val) {
            return false;
        } else {
            //注意返回的值return leftFlag && rightFlag;
            return leftFlag && rightFlag;
        }


//        return leftFlag&&rightFlag;
    }

}