LeetCode - 101. Symmetric Tree

最新推荐文章于 2017-06-01 17:27:42 发布

这个好玩吗

最新推荐文章于 2017-06-01 17:27:42 发布

阅读量234

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/flx413/article/details/54604128

版权

LeetCode 专栏收录该内容

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

/**
 * 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* lt, TreeNode* rt ) {
        if( lt == NULL && rt == NULL ) return true;
        if( lt == NULL || rt == NULL ) return false;
        if( lt->val != rt->val ) return false;
            
        return isSymmetric( lt->left, rt->right ) && isSymmetric( lt->right, rt->left );
    }
    
    bool isSymmetric(TreeNode* root) {
        if( root == NULL ) return true;
        else {
            return isSymmetric( root->left, root->right );
        }
    }
};