A101

最新推荐文章于 2024-08-07 10:27:33 发布

xgl112112

最新推荐文章于 2024-08-07 10:27:33 发布

阅读量157

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/xgl112112/article/details/52548605

版权

leetcode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

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:

本题与100题类似，只不过100题为判断两棵树是否是同一颗树，而本题只是查看root的左树与右树对应节点是否相等

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