/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool isSameTree(TreeNode* p, TreeNode* q) {
//终止条件
if(p == NULL || q == NULL)
return (p == q);
if(p->val != q->val)
return false;
else{
if(isSameTree(p->left, q->left)){
if(isSameTree(p->right, q->right))
return true;
else
return false;
}
else
return false;
}
}
};
LeetCode上别人的简化版
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));
}