Symmetric Tree

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

dk_swjtu

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

阅读量283

点赞数

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

本文链接：https://blog.csdn.net/dk_swjtu/article/details/43370679

版权

leetcode 专栏收录该内容

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

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

递归判断左子树的左子树是否等于右子树的右子树和左子树的右子树是否等于右子树的左子树，代码如下：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    bool issysmetric(TreeNode *left,TreeNode *right)
    {
        if(!left&&!right) return true;
        if(left && right && left->val==right->val) return issysmetric(left->left,right->right)&issysmetric(left->right,right->left);
        else return false;
    }
public:
    bool isSymmetric(TreeNode *root) {
        if(!root) return true;
        return issysmetric(root->left,root->right);
    }
};