Leetcode 101. Symmetric Tree

最新推荐文章于 2020-12-23 16:34:34 发布

zhangwj0101

最新推荐文章于 2020-12-23 16:34:34 发布

阅读量241

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.csdn.net/zhangwj0101/article/details/51006031

Leetcode 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一种算法来判断给定的二叉树是否是对称的，即树的左右子树是否镜像对称。

Question

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:

Code

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

    }


    public boolean isSymmetric(TreeNode root) {
        if (root == null) {
            return true;
        }

        return judge(root.left, root.right);
    }