LeetCode--symmetric-tree

最新推荐文章于 2022-02-25 20:00:37 发布

Miles-

最新推荐文章于 2022-02-25 20:00:37 发布

阅读量202

点赞数

分类专栏： LeetCode 文章标签： LeetCode C

本文链接：https://blog.csdn.net/wl_ss/article/details/78997674

版权

LeetCode 专栏收录该内容

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

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

The above binary tree is serialized as"{1,2,3,#,#,4,#,#,5}".

/**
 * 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 isSymmetric(TreeNode *root) {
        if(root==NULL)
            return true;
        return isEqual(root->left,root->right);
    }
    bool isEqual(TreeNode *root1,TreeNode *root2){
        if(root1==NULL&&root2==NULL)
            return true;
        if(root1==NULL||root2==NULL)
            return false;
        if(root1->val != root2->val)
            return false;
        return isEqual(root1->left,root2->right)&&isEqual(root1->right,root2->left);
    }
};

本题与剑指offer中的对称的二叉树一样，非递归的方法就是用两个栈存储根节点的左右孩子进行比较，具体可以参照链接中的解法