Leecode 101. 对称二叉树 递归

原题链接：Leecode 101. 对称二叉树


递归：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool mirror(TreeNode* p1,TreeNode* p2)
    {
        if(!p1 && !p2) return true;
        else if(!p1 || !p2) return false;
        return p1->val==p2->val && mirror(p1->left,p2->right) && mirror(p1->right,p2->left);
    }
    bool isSymmetric(TreeNode* root) {
        return mirror(root,root);
    }
};

队列

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool fun(TreeNode* p1,TreeNode* p2)
    {
        queue<TreeNode* > q;
        q.push(p1); q.push(p2);
        while(!q.empty())
        {
            p1=q.front();q.pop();
            p2=q.front();q.pop();
            if(!p1 && ! p2) continue;
            if( (!p1 || !p2) ||( p1 && p2 && p1->val!=p2->val ) ) return false;
            q.push(p1->left);
            q.push(p2->right);
            q.push(p1->right);
            q.push(p2->left);
        }
        return true;
    }
    bool isSymmetric(TreeNode* root) {
        return fun(root,root);
    }
};