101. Symmetric Tree

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:

    1
   / \
  2   2
 / \ / \
3  4 4  3

But the following [1,2,2,null,3,null,3] is not:

    1
   / \
  2   2
   \   \
   3    3

/**
 * 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 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);
    }
};


发布了30 篇原创文章 · 获赞 3 · 访问量 3万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览