LeetCode 101 Symmetric Tree

ShenduCC

发布于 2018-04-27 12:23:57

5910

发布于 2018-04-27 12:23:57

文章被收录于专栏：算法修养

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-04-20 ，如有侵权请联系 cloudcommunity@tencent.com 删除

编程算法