101. Symmetric Tree
2018-02-05 00:13
218 查看
class Solution {
public:
bool isSymmetric(TreeNode* root) {
if(!root) return true;
return isSymmetric(root->left,root->right);
}
bool isSymmetric(TreeNode* root1,TreeNode* root2) {
if(!root1 || !root2) return root1==root2;
return root1->val == root2->val ? isSymmetric(root1->left,root2->right) && isSymmetric(root1->right,root2->left) : false;
}
};
public:
bool isSymmetric(TreeNode* root) {
if(!root) return true;
return isSymmetric(root->left,root->right);
}
bool isSymmetric(TreeNode* root1,TreeNode* root2) {
if(!root1 || !root2) return root1==root2;
return root1->val == root2->val ? isSymmetric(root1->left,root2->right) && isSymmetric(root1->right,root2->left) : false;
}
};
相关文章推荐
- LeetCode: Symmetric Tree [101]
- 【LeetCode】101 - Symmetric Tree
- LeetCode101 Symmetric Tree
- LeetCode笔记:101. Symmetric Tree
- 101. Symmetric Tree
- leecode 解题总结:101. Symmetric Tree
- leetcode-101-Symmetric Tree
- leetcode101 Symmetric Tree
- leetcode-101 Symmetric Tree
- FTPrep, 101 Symmetric Tree
- leetcode 101. Symmetric Tree
- Java for LeetCode 101 Symmetric Tree
- [leetcode-101]Symmetric Tree(c++)
- 【LEETCODE】101-Symmetric Tree
- LeetCode 101:Symmetric Tree
- LeetCode 101. Symmetric Tree(对称的树)
- LeetCode 101. Symmetric Tree
- [leedcode 101] Symmetric Tree
- 【101-Symmetric Tree(对称树)】
- [leetcode 101]Symmetric Tree