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

102.二叉树的层序遍历

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {

        List<List<Integer>> linkedList = new LinkedList<>();
        if (root == null) {
            return linkedList;
        }
        Queue<TreeNode> queue = new LinkedList();
        TreeNode node = root;
        queue.offer(node);

        List<Integer> tempLinkedList = new LinkedList<>();

        TreeNode curEndNode = root;
        TreeNode nextEndNode = null;

        while (!queue.isEmpty()) {
            node = queue.poll();
            tempLinkedList.add(node.val);
            
            if (node.left != null) {
                queue.offer(node.left);
                nextEndNode = node.left;
            }
            if (node.right != null) {
                queue.offer(node.right);
                nextEndNode = node.right;
            }

            if (curEndNode == node) {
                linkedList.add(tempLinkedList);
                tempLinkedList = new LinkedList<>();
                curEndNode = nextEndNode;
            }


        }


        return linkedList;

    }
}

226.翻转二叉树

class Solution {
    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        while (!queue.isEmpty()) {
            TreeNode node = queue.poll();
            if (node.left != null) {
                queue.offer(node.left);
            }
            if (node.right != null) {
                queue.offer(node.right);
            }
            TreeNode temp = node.left;
            node.left = node.right;
            node.right = temp;
        }

        return root;

    }
}

101.对称二叉树

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if (root == null) {
            return true;
        } else if (root.left == null && root.right == null) {
            return true;
        } else if (!(root.left != null && root.right != null && root.left.val == root.right.val)) {
            return false;
        }

        Queue<TreeNode> queue = new LinkedList();
        queue.offer(root.left);
        queue.offer(root.right);
        while (!queue.isEmpty()) {
            TreeNode firPoll = queue.poll();
            TreeNode secPoll = queue.poll();
            if (firPoll.left != null && secPoll.right != null && firPoll.left.val == secPoll.right.val) {
                queue.offer(firPoll.left);
                queue.offer(secPoll.right);
            } else if (!(firPoll.left == null && secPoll.right == null)) {
                return false;

            }
            if (firPoll.right != null && secPoll.left != null && firPoll.right.val == secPoll.left.val) {
                queue.offer(firPoll.right);
                queue.offer(secPoll.left);
            } else if (!(firPoll.right == null && secPoll.left == null)) {
                return false;
            }

        }
        return true;

    }
}