代码随想录算法训练营-day15-102. 二叉树的层序遍历、226. 翻转二叉树、101. 对称二叉树

最新推荐文章于 2024-07-15 11:08:21 发布

依旧1919

最新推荐文章于 2024-07-15 11:08:21 发布

阅读量340

点赞数

分类专栏：代码随想录算法训练营文章标签：算法 leetcode 数据结构 java

本文链接：https://blog.csdn.net/weixin_47067912/article/details/127856562

版权

代码随想录算法训练营专栏收录该内容

53 篇文章 0 订阅

订阅专栏

102. 二叉树的层序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    List<List<Integer>> result = new ArrayList<>();
    public List<List<Integer>> levelOrder(TreeNode root) {
        Oeder(root, 0);
        return result;
    }
    private void Oeder(TreeNode cur, Integer deep){
        if(cur == null) return;
        deep++;
        if(result.size() < deep){
            List<Integer> res = new ArrayList<>();
            result.add(res);
        }
        result.get(deep - 1).add(cur.val);
        Oeder(cur.left, deep);
        Oeder(cur.right, deep);
    }
}

226. 翻转二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode invertTree(TreeNode root) {
        Deque<TreeNode> que = new LinkedList<>();
        if (root == null) return root;
        que.add(root);
        while (!que.isEmpty()) {
            int size = que.size();
            while (size-- > 0 ){
                TreeNode node = que.poll();
                swap(node);
                if (node.left != null) que.add(node.left);
                if (node.right != null) que.add(node.right);
            }
        }
        return root;
    }
    private void swap(TreeNode root) {
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
    }
}

101. 对称二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        Deque<TreeNode> que = new LinkedList<>();
        que.offer(root.left);
        que.offer(root.right);
        while (!que.isEmpty()) {
            TreeNode leftNode = que.poll();
            TreeNode rightNode = que.poll();
            if (leftNode == null && rightNode == null) continue;
            if (leftNode == null || rightNode == null || (leftNode.val != rightNode.val)) return false;
            que.offer(leftNode.left);
            que.offer(rightNode.right);
            que.offer(leftNode.right);
            que.offer(rightNode.left);
        }
        return true;
    }
}