Leetcode - Tree - Symmetric Tree

最新推荐文章于 2022-06-04 21:05:23 发布

原创最新推荐文章于 2022-06-04 21:05:23 发布 · 390 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一种检查二叉树是否关于其中心对称的方法，并提供了递归和迭代两种解决方案。通过示例展示了对称与非对称二叉树的区别。

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