bool isSameTree(struct TreeNode* p, struct TreeNode* q) {
if (p && q) {
return p->val == q->val // 分解
&& isSameTree(p->left, q->left)
&& isSameTree(p->right, q->right);
} else if (p == NULL && q == NULL) {
return true;
} else {
// 一个为NULL，另一个不为NULL
return false;
}
}
leetcode 100.相同的树
2024-02-14 00:20:03 39 阅读
![[<span style='color:red;'>leetcode</span>] <span style='color:red;'>100</span>. <span style='color:red;'>相同</span><span style='color:red;'>的</span><span style='color:red;'>树</span>](https://img-blog.csdnimg.cn/direct/50a32d2d308e4daf860535700e2b4a44.png)
![[NSSCTF]-Web:[SWPUCTF 2021 新生赛]easyrce解析](https://img-blog.csdnimg.cn/direct/060bebcd2c124372804bc6c264c0503c.png)
![[C++]17:二叉树进阶](https://img-blog.csdnimg.cn/direct/41f872e53f5a49d5a6715729dcd6ef9b.png)
