题目来源
题目描述
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode() : val(0), left(nullptr), right(nullptr) {}
TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
}
};
题目解析
递归(对称性递归)
先序遍历的递归形式
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p == NULL && q == NULL){
return true;
}
if(p == NULL || q == NULL){
return false;
}
if(q->val != p->val){
return false;
}
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
};
树形DP(待续)
两棵树如果相同,那么:
- 它们的左子树相同
- 它们的右子树相同
- 当前树相同
…
队列–层次遍历
public boolean isSameTree(TreeNode p, TreeNode q) {
LinkedList<TreeNode> queue = new LinkedList<>();
queue.offer(p);
queue.offer(q);
while (!queue.isEmpty()){
TreeNode p1 = queue.pop();
TreeNode p2 = queue.pop();
if (p1 == null && p2 == null){
continue; //易错点 [12 null 69] [12 null 11]
}
if (p1 == null || p2 == null){
return false;
}
if (p1.val != p2.val){
return false;
}
queue.offer(p1.left);
queue.offer(p2.left);
queue.offer(p1.right);
queue.offer(p2.right);
}
return true;
}