Symmetric Tree

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

steamedro11

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

阅读量171

点赞数

分类专栏： LeetCode-Tree

本文链接：https://blog.csdn.net/steamedro11/article/details/59174218

版权

LeetCode-Tree 专栏收录该内容

1 篇文章 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:

答案：

通过递归来实现，从上到下判断是否左右相等

public boolean isSymmetric(TreeNode root) {
    return root==null || isSymmetricHelp(root.left, root.right);
}

private boolean isSymmetricHelp(TreeNode left, TreeNode right){
    if(left==null || right==null)
        return left==right;
    if(left.val!=right.val)
        return false;
    return isSymmetricHelp(left.left, right.right) && isSymmetricHelp(left.right, right.left);
}