LeetCode 100. Same Tree
2017-01-25 09:10
363 查看
解题思路:树的递归
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p == NULL || q == NULL)
return p == q;
else
return p->val == q->val && isSameTree(p->left,q->left) && isSameTree(p->right, q->right);
}
};
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p == NULL || q == NULL)
return p == q;
else
return p->val == q->val && isSameTree(p->left,q->left) && isSameTree(p->right, q->right);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 100. Same Tree
- [DFS] leetcode 100. Same Tree
- 【LeetCode】100. Same Tree
- 算法作业HW28：LeetCode 100. Same Tree
- LeetCode 100. Same Tree
- LeetCode 100. Same Tree
- leetcode 100. Same Tree
- leetcode 100. Same Tree
- Leetcode 100. Same Tree
- LeetCode 100. Same Tree
- [LeetCode]100. Same Tree
- leetcode 100. Same Tree
- 【Leetcode】100. Same Tree
- 【LEETCODE】100-Same Tree
- leetcode - Same Tree
- [LeetCode] Same Tree
- 【leetcode刷题笔记】Same Tree
- [LeetCode] Same Tree
- LeetCode - Same Tree
- leetcode[100]:Same Tree