LeetCode刷题(C++)——Symmetric Tree(Easy)
2017-04-30 11:22
357 查看
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree
But the following
/**
* 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==NULL)
return true;
return isSymmetric(root,root);
}
bool isSymmetric(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1==NULL&&pRoot2==NULL)
return true;
if(pRoot1==NULL||pRoot2==NULL)
return false;
if(pRoot1->val!=pRoot2->val)
return false;
return isSymmetric(pRoot1->left,pRoot2->right)&&isSymmetric(pRoot1->right,pRoot2->left);
}
};
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 isSymmetric(TreeNode* root) {
if(root==NULL)
return true;
return isSymmetric(root,root);
}
bool isSymmetric(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1==NULL&&pRoot2==NULL)
return true;
if(pRoot1==NULL||pRoot2==NULL)
return false;
if(pRoot1->val!=pRoot2->val)
return false;
return isSymmetric(pRoot1->left,pRoot2->right)&&isSymmetric(pRoot1->right,pRoot2->left);
}
};
相关文章推荐
- leetcode_Symmetric Tree_判断二叉树镜像对称_easy_方法
- [LeetCode] 007. Reverse Integer (Easy) (C++/Java/Python)
- LeetCode的easy题集合(C++实现)三
- [LeetCode] 036. Valid Sudoku (Easy) (C++)
- [leetcode-101]Symmetric Tree(c++)
- 【Leetcode】【Easy】Symmetric Tree
- leetcode_206_Reverse Linked List(easy)(C++)
- LeetCode的easy题集合(C++实现)一
- [Leetcode 101, Easy] Symmetric Tree
- leetcode_242_Valid Anagram(easy)(C++)(Java)
- [LeetCode] 008. String to Integer (Easy) (C++/Java/Python)
- [LeetCode] 020. Valid Parentheses (Easy) (C++/Java/Python)
- [LeetCode] 019. Remove Nth Node From End of List (Easy) (C++/Python)
- LeetCode的easy题集合(C++实现)二
- [LeetCode] 028. Implement strStr() (Easy) (C++/Python)
- [LeetCode] 006. ZigZag Conversion (Easy) (C++/Java/Python)
- [LeetCode] 014. Longest Common Prefix (Easy) (C++/Java/Python)
- [LeetCode] 026. Remove Duplicates from Sorted Array (Easy) (C++/Java)
- 【leetcode c++】101 Symmetric Tree
- leetcode_258_Add Digit(easy)(C++)