leetcode:101 Symmetric Tree－每日编程第二十题

最新推荐文章于 2024-07-05 14:15:00 发布

寒风中的易水

最新推荐文章于 2024-07-05 14:15:00 发布

阅读量490

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/fjzpdkf/article/details/50261279

版权

leetcode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

Symmetric Tree

Total Accepted: 83908 Total Submissions: 257485 Difficulty: Easy

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).还是得先判断是否为NULL,否则root->val就没有意义。

2).接着定义一个重载函数isSymmetric(TreeNode* left,TreeNode* right)，用来判断left与right是否相等。不等返回false,相等则返回isSymmetric(left->right,right->left)&&isSymmetric(left->left,right->right)。即不断递归，判断每层是否对称。

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