Symmetric Tree

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

VintNee

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

阅读量859

点赞数

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

本文链接：https://blog.csdn.net/vintionnee/article/details/22735515

版权

leetcode 专栏收录该内容

60 篇文章 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.

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

两个函数,一个是判断相等,一个是交换左右子树

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool isEqual(TreeNode *root1, TreeNode *root2)
    {
        if(!root1&&!root2)
            return true;
        if(!root1||!root2)
            return false;
        if(!root1->left&&!root1->right&&!root2->left&&!root2->right&&root1->val==root2->val)
            return true;
        if(isEqual(root1->left, root2->left)&&isEqual(root1->right, root2->right)&&root1->val==root2->val)
            return true;
        return false;
    }
    void swapLeftRight(TreeNode *root)
    {
        if(NULL==root||(NULL==root->left&&NULL==root->right))return;
        swapLeftRight(root->left);
        swapLeftRight(root->right);
        TreeNode *temp = root->left;
        root->left = root->right;
        root->right = temp;
    }

    bool isSymmetric(TreeNode *root) {
        if(!root)
            return true;
        swapLeftRight(root->left);
        if(isEqual(root->left,root->right))
            return true;
        return false;
    }
};