题目链接:https://leetcode-cn.com/problems/same-tree/
题目如下:
/**
* Definition for a binary tree node.
* 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) {
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;
return dfs(p->left,q->left)&&dfs(p->right,q->right);
}
bool dfs(TreeNode* p1,TreeNode* p2){
if(p1==NULL&&p2==NULL) return true;
if(p1==NULL&&p2!=NULL) return false;
if(p1!=NULL&&p2==NULL) return false;
if(p1->val!=p2->val) return false;
return dfs(p1->left,p2->left)&&dfs(p1->right,p2->right);
}
};