LeetCode : 101. Symmetric Tree 对称二叉树

最新推荐文章于 2023-10-18 08:51:01 发布

青盏

最新推荐文章于 2023-10-18 08:51:01 发布

阅读量120

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_16234613/article/details/90173340

版权

LeetCode 专栏收录该内容

154 篇文章 1 订阅

订阅专栏

试题
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

But the following [1,2,2,null,3,null,3] is not:

代码
由于比较的是两个不同位置的节点值，因此递归函数需要接受两个参数。
然后就是注意下比较值的时候有null和val两种区别。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root==null) return true;
        return checkSy(root.left, root.right);
    }
    
    public boolean checkSy(TreeNode left, TreeNode right){
        boolean is = (left==null&&right==null) || ((left!=null&&right!=null)&&(left.val==right.val));
        
        if(is && left!=null && right!=null)
            return is && checkSy(left.left, right.right) && checkSy(left.right, right.left);
        else
            return is;
    }
}