题解:二叉树的遍历,dfs
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p==NULL||q==NULL)return p==q;
return p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}
题解:二叉树的遍历,dfs
bool isSameTree(TreeNode* p, TreeNode* q) {
if(p==NULL||q==NULL)return p==q;
return p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}