101 Symmetric Tree

最新推荐文章于 2021-06-11 11:16:20 发布

不行就重启

最新推荐文章于 2021-06-11 11:16:20 发布

阅读量495

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/efergrehbtrj/article/details/47771797

版权

leetcode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

101 Symmetric Tree

链接：https://leetcode.com/problems/symmetric-tree/
问题描述：
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:

Note:
Bonus points if you could solve it both recursively and iteratively.

confused what “{1,#,2,3}” means? > read more on how binary tree is serialized on OJ.

Hide Tags Tree Depth-first Search

检查一棵树是否是对称的，这个问题可以用递归做。

class Solution {
public:

    bool isSymmetric(TreeNode* root) {
         if(root==NULL)return true;
         return mSymmetric(root->left,root->right);
    }

    bool mSymmetric(TreeNode* n1,TreeNode* n2)
    {
        if(n1==NULL&&n2==NULL)return true;
        else if(n1==NULL||n2==NULL) return false;
        else if(n1->val!=n2->val)return false;
        else return mSymmetric(n1->left,n2->right)&&mSymmetric(n1->right,n2->left);
    }
};