101. Symmetric Tree

最新推荐文章于 2017-09-23 20:27:01 发布

YHJunE

最新推荐文章于 2017-09-23 20:27:01 发布

阅读量148

点赞数

分类专栏： leetcode刷题

本文链接：https://blog.csdn.net/yanhangy/article/details/78002602

版权

leetcode刷题专栏收录该内容

33 篇文章 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:

Note:
Bonus points if you could solve it both recursively and iteratively.

我的：

/**
 * Definition for a binary tree node.
 * 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){
            return true;
        }
        reverse(root->left);
        return __isSymmetric(root->left, root->right);
        
    }
    
    bool __isSymmetric(TreeNode* t1, TreeNode* t2){
        if((!t1 && t2) || (t1 && !t2)){
            return false;
        }
        
        if(!t1 && !t2){
            return true;
        }
        
        if(t1->val != t2->val){
            return false;
        }
        
        return __isSymmetric(t1->left, t2->left) && __isSymmetric(t1->right, t2->right);
        
    }
    
    void reverse(TreeNode* root){
        if(!root){
            return;
        }
        TreeNode* temp = root->left;
        root->left = root->right;
        root->right = temp;
        reverse(root->left);
        reverse(root->right);
    }
};

leetcode上的

bool isSymmetric(TreeNode *root) {
        if (!root) return true;
        return helper(root->left, root->right);
    }
    
    bool helper(TreeNode* p, TreeNode* q) {
        if (!p && !q) {
            return true;
        } else if (!p || !q) {
            return false;
        }
        
        if (p->val != q->val) {
            return false;
        }
        
        return helper(p->left,q->right) && helper(p->right, q->left); 
    }