Leetcode - 101. Symmetric Tree

_浮生_

于 2020-08-20 22:12:59 发布

阅读量96

点赞数

分类专栏： leetcode 文章标签：二叉树

本文链接：https://blog.csdn.net/zqxf123456789/article/details/108136058

版权

leetcode 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

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

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

But the following [1,2,2,null,3,null,3] is not:

Solution:

/**
 * 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 isSymmetric(TreeNode* root) {        
        if(root == nullptr)
            return true;
        
        std::queue<TreeNode*> q;
        q.push(root->left);
        q.push(root->right);
        
        while(!q.empty())
        {
            auto left = q.front(); q.pop();
            auto right = q.front(); q.pop();
            
            if(!left && !right) continue;
            if(!left || !right) return false;
            if(left->val != right->val) return false;
            
            q.push(left->left);
            q.push(right->right);
            
            q.push(left->right);
            q.push(right->left);
        }
        
        return true;
    }
};

// 递归
class Solution {
public:
    bool isSymmetric(TreeNode* root) {
         if(root == nullptr)
             return true;
        
         return symmetricNodes(root->left, root->right);
    }
    
private:
    bool symmetricNodes(TreeNode* left, TreeNode* right)
    {
        if(!left && !right)
            return true;
        
        if(!left || !right)
            return false;
        
        if(left->val == right->val)
        {
            return symmetricNodes(left->left, right->right) && symmetricNodes(left->right, right->left);
        }
        
        return false;
    }
};