/** * Definition for binary tree * 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 && p->val == q->val){ return isSameTree(p->left, q->left)&&isSameTree(p->right, q->right); } return false; } };
原文:http://www.cnblogs.com/Kobe10/p/6346604.html