代码随想录——对称二叉树（Leetcode101）

最新推荐文章于 2024-06-22 22:59:06 发布

肉松拿铁

最新推荐文章于 2024-06-22 22:59:06 发布

阅读量281

点赞数 7

分类专栏：算法题java版文章标签： leetcode 数据结构算法 java

本文链接：https://blog.csdn.net/qq_46574748/article/details/139016556

版权

算法题java版专栏收录该内容

94 篇文章 0 订阅

订阅专栏

题目链接
在这里插入图片描述

递归

/**
 * 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) {
        if(root==null){
            return true;
        }
        return check(root.left,root.right);
    }

    boolean check(TreeNode l,TreeNode r){
        if(l==null&&r==null){
            return true;
        }
        if(l==null||r==null){
            return false;
        }
        if(l.val!=r.val){
            return false;
        }
        return check(l.left,r.right)&&check(l.right,r.left);
    }
}

队列

/**
 * 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) {
        if(root == null){
            return true;
        }
        Deque<TreeNode> queue = new LinkedList<TreeNode>();
        queue.offer(root.left);
        queue.offer(root.right);
        while(!queue.isEmpty()){
            TreeNode left = queue.poll();
            TreeNode right = queue.poll();
            if(left ==null && right == null){
                continue;
            }
            if(left == null || right == null){
                return false;
            }else if(left.val != right.val){
                return false;
            }
            queue.push(left.left);
            queue.push(right.right);
            queue.push(left.right);
            queue.push(right.left);
        }
        return true;
    }
}