思路:递归。很好理解,递归遍历所有节点,然后进行判断即可。
/**
* 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&&!q) return true;
if((!p&&q)||(p&&!q)||(p->val!=q->val)) return false;
return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
}
};