101. Symmetric Tree
- Total Accepted: 135050
- Total Submissions: 374655
- Difficulty: Easy
- Contributors: Admin
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
解题思路:
本题与判断两棵树是否相等类似,只是在递归的过程中要注意比较的对象。
return sym(l->left,r->right)&&sym(l->right,r->left);
代码展示:
/**
* 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 sym(TreeNode* l,TreeNode* r)
{
if(l==NULL&&r==NULL) return true;
if(l==NULL||r==NULL) return false;
if(l->val!=r->val) return false;
return sym(l->left,r->right)&&sym(l->right,r->left);
}
bool isSymmetric(TreeNode* root) {
if(!root) return true;
return sym(root->left,root->right);
}
};
101. Symmetric Tree
- Total Accepted: 135050
- Total Submissions: 374655
- Difficulty: Easy
- Contributors: Admin
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
解题思路:
本题与判断两棵树是否相等类似,只是在递归的过程中要注意比较的对象。
return sym(l->left,r->right)&&sym(l->right,r->left);
代码展示:
/**
* 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 sym(TreeNode* l,TreeNode* r)
{
if(l==NULL&&r==NULL) return true;
if(l==NULL||r==NULL) return false;
if(l->val!=r->val) return false;
return sym(l->left,r->right)&&sym(l->right,r->left);
}
bool isSymmetric(TreeNode* root) {
if(!root) return true;
return sym(root->left,root->right);
}
};