/**
* 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) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if((p==NULL&&q!=NULL)||(p!=NULL&&q==NULL))
return false;
if(p==NULL&&q==NULL)
return true;
while(p!=NULL&&q!=NULL)
{
if(p->val==q->val)
return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);
else
return false;
}
}
};
【leetcode】Same Tree
最新推荐文章于 2020-07-27 10:14:22 发布