Leetcode Same Tree
2016-12-17 12:51
337 查看
题意:判断两棵树是否相等。
思路:DFS。
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p == NULL && q == NULL) return true;
if(p == NULL && q != NULL) return false;
if(p != NULL && q == NULL) return false;
if(p->val != q->val) return false;
bool leftmark = false;
bool rightmark = false;
if(p->left) {
if(q ->left) leftmark = isSameTree(p->left, q->left);
else leftmark = false;
}
else {
if(q->left) leftmark = false;
else leftmark = true;
}
if(p->right) {
if(q->right) rightmark = isSameTree(p->right, q->right);
else rightmark = false;
}
else {
if(q->right) rightmark = false;
else rightmark = true;
}
if(leftmark && rightmark) return true;
else return false;
}
};
思路:DFS。
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p == NULL && q == NULL) return true;
if(p == NULL && q != NULL) return false;
if(p != NULL && q == NULL) return false;
if(p->val != q->val) return false;
bool leftmark = false;
bool rightmark = false;
if(p->left) {
if(q ->left) leftmark = isSameTree(p->left, q->left);
else leftmark = false;
}
else {
if(q->left) leftmark = false;
else leftmark = true;
}
if(p->right) {
if(q->right) rightmark = isSameTree(p->right, q->right);
else rightmark = false;
}
else {
if(q->right) rightmark = false;
else rightmark = true;
}
if(leftmark && rightmark) return true;
else return false;
}
};
相关文章推荐
- leetcode笔记:Same Tree
- LeetCode Same Tree
- Same Tree Leetcode c#
- Leetcode 之Same Tree(48)
- LeetCode 100: Same Tree
- Leetcode Same Tree
- leetcode第49题(same-tree)
- Leetcode Q100 : Same Tree
- 开荒新系列之LeetCode: 004-Same Tree
- Leetcode: Same Tree
- 【LeetCode】(100)Same Tree(Easy)
- leetcode:Same Tree 【Java】
- LeetCode Same Tree 100
- LeetCode Same Tree
- Leetcode_num3_Same Tree
- leetcode 100 Same Tree C++
- Leetcode: Same Tree
- 【LeetCode从零单刷】Same Tree
- leetcode--Same Tree
- LeetCode——same-tree