Symmetric Tree

最新推荐文章于 2022-04-21 23:25:34 发布

poiop221

最新推荐文章于 2022-04-21 23:25:34 发布

阅读量291

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/poiop221/article/details/47323607

版权

leetcode 专栏收录该内容

174 篇文章 0 订阅

订阅专栏

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

For example, this binary tree is symmetric:

But the following is not:

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