解题思路:当前结点相同,递归判断左右子树,左子树和右子树比,右子树和左子树比。
/** * 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 true; if (p == NULL || q == NULL) return false; if (!isSameTree(p->left, q->left)) return false; if (p->val != q->val) return false; if (!isSameTree(p->right, q->right)) return false; return true; } };