Symmetric Tree

最新推荐文章于 2022-04-21 23:25:34 发布

benbenab

最新推荐文章于 2022-04-21 23:25:34 发布

阅读量275

点赞数

分类专栏： Tree

本文链接：https://blog.csdn.net/benbenab/article/details/8181377

版权

Tree 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

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:

1. Recursive method

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        //bool symmetric = false;
        
        if (root==NULL)
            return true;
            
        return isSymmetric(root->left, root->right);
    }
    
    bool isSymmetric(TreeNode *root1, TreeNode *root2){
        if (root1==NULL && root2 == NULL)
            return true;
            
        if (root1 == NULL || root2==NULL)
            return false;
            
        if (root1->val != root2->val)
            return false;
            
        return isSymmetric(root1->left, root2->right)&&isSymmetric(root1->right, root2->left);
    }
};

2. iterative

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (root==NULL)
            return true;
            
        vector<TreeNode*> temp;
        if (root->left && root->right){
            if (root->left->val == root->right->val){
                temp.push_back(root->left);
                temp.push_back(root->right);
            }
            else
                return false;
        }
        else if (root->left == NULL && root->right == NULL)
            return true;
        else
            return false;
        while (temp.size()>0){
            TreeNode *node1 = temp.back();
            temp.pop_back();
            TreeNode *node2 = temp.back();
            temp.pop_back();
            
            if (node1->left == NULL && node2->right == NULL);
            else if (node1->left == NULL ||node2->right==NULL)
                return false;
            else if (node1->left->val != node2->right->val)
                return false;
            else{
                temp.push_back(node1->left);
                temp.push_back(node2->right);
            }
            
            if (node1->right == NULL && node2->left == NULL);
            else if  (node1->right == NULL || node2->left == NULL)
                return false;
            else if (node1->right->val != node2->left->val)
                return false;
            else{
                    temp.push_back(node1->right);
                    temp.push_back(node2->left);
            }
        }
        return true;
    }
};