Leetcode - Tree - Symmetric Tree

最新推荐文章于 2020-12-28 22:34:43 发布

JerkWisdom

最新推荐文章于 2020-12-28 22:34:43 发布

阅读量469

点赞数

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

本文链接：https://blog.csdn.net/jonathan321/article/details/24721589

版权

Leetcode 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

/**
 * 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 *l, TreeNode *r)
    {
        if(l==NULL&&r==NULL)
            return true;
        if(l==NULL&&r!=NULL||l!=NULL&&r==NULL)
            return false;
        if(l->val==r->val&&isEqual(l->left,r->right)&&isEqual(l->right,r->left))
                return true;
        else
            return false;
    }
};

/**
 * 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;
        stack<TreeNode*> nodeStack;
        nodeStack.push(root->left);
        nodeStack.push(root->right);
        TreeNode *lhs=NULL,*rhs=NULL;
        while(nodeStack.size()>1)
        {
            lhs=nodeStack.top();
            nodeStack.pop();
            rhs=nodeStack.top();
            nodeStack.pop();
            if(!lhs&&!rhs) continue;
            if((lhs&&!rhs)||(!lhs&&rhs)) return false;
            if(lhs->val!=rhs->val)return false;
            nodeStack.push(lhs->left);
            nodeStack.push(rhs->right);
            nodeStack.push(lhs->right);
            nodeStack.push(rhs->left);
        }
        return true;
    }
};