![在这里插入图片描述](https://img-blog.csdnimg.cn/20210304231252721.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1NMX1dvcmxk,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210304231306894.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1NMX1dvcmxk,size_16,color_FFFFFF,t_70)
1 DFS
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if (!p && !q) return true;
if (!p || !q) return false;
if (p->val == q->val)
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
return false;
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210304231405420.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1NMX1dvcmxk,size_16,color_FFFFFF,t_70)
2 BFS
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
if (!p && !q) return true;
if (!p || !q) return false;
queue<TreeNode*> pp, qq;
pp.push(p);
qq.push(q);
while(!qq.empty()) {
TreeNode* p_node = pp.front(); pp.pop();
TreeNode* q_node = qq.front(); qq.pop();
if (p_node->val != q_node->val) return false;
if ((!p_node->left && q_node->left) || (p_node->left && !q_node->left) ||(!p_node->right && q_node->right) || (p_node->right && !q_node->right))
return false;
if (p_node->left && q_node->left) {
pp.push(p_node->left);
qq.push(q_node->left);
}
if (p_node->right && q_node->right) {
pp.push(p_node->right);
qq.push(q_node->right);
}
}
return true;
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/20210304233607956.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1NMX1dvcmxk,size_16,color_FFFFFF,t_70)