关闭

101. Symmetric Tree

90人阅读 评论(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:

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

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

    1
   / \
  2   2
   \   \
   3    3

Note:
Bonus points if you could solve it both recursively and iteratively.

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


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:73480次
    • 积分:1854
    • 等级:
    • 排名:千里之外
    • 原创:96篇
    • 转载:107篇
    • 译文:1篇
    • 评论:9条
    最新评论