牛客刷题二叉树之对称二叉树

题目描述

请实现一个函数，用来判断一棵二叉树是不是对称的。注意，如果一个二叉树同此二叉树的镜像是同样的，定义其为对称的。

牛客链接：

https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&&tqId=11211&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

解题思路：

用两种方式，递归和非递归

代码一：
递归方式

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    bool isSymmetrical(TreeNode* pRoot)
    {
        if(pRoot == NULL) return true;
        return isSymmetricalCore(pRoot->left, pRoot->right);
    }
    bool isSymmetricalCore(TreeNode* left, TreeNode* right) {
        if(left == NULL && right == NULL) return true;
        if(left != NULL && right == NULL) return false;
        if(left == NULL && right != NULL) return false;
        bool leftFlag = isSymmetricalCore(left->left, right->right);
        bool rightFlag = isSymmetricalCore(left->right, right->left);
        bool flag = left->val==right->val ? true:false;
        return flag && leftFlag && rightFlag;
    }

};

代码二：
非递归方式

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/
class Solution {
public:
    bool isSymmetrical(TreeNode* pRoot)
    {
        if(pRoot == NULL) return true;
        stack<TreeNode*> stk;
        stk.push(pRoot->left);
        stk.push(pRoot->right);
        while(!stk.empty()) {
            TreeNode* right = stk.top();
            stk.pop();
            TreeNode* left = stk.top();
            stk.pop();
            if(right==NULL && left==NULL) continue;
            if(right==NULL || left==NULL) return false;
            if(right->val != left->val) return false;
            stk.push(left->left);
            stk.push(right->right);
            stk.push(left->right);
            stk.push(right->left);
        }
        return true;
    }
};