【LeetCode】101. Symmetric Tree

最新推荐文章于 2020-12-23 16:34:34 发布

Juxin_Lin

最新推荐文章于 2020-12-23 16:34:34 发布

阅读量328

点赞数

分类专栏： leetcode 递归文章标签： leetcode 递归

本文链接：https://blog.csdn.net/Juxin_Lin/article/details/54234899

版权

leetcode 同时被 2 个专栏收录

39 篇文章 0 订阅

订阅专栏

递归

3 篇文章 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.

Difficulty: Easy

题目分析:

这道题目的递归解答比较好想，看图写码即可。

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