Given two binary trees, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical and the nodes have the same value.
Example 1:
Input: 1 1 / \ / \ 2 3 2 3 [1,2,3], [1,2,3] Output: true
Example 2:
Input: 1 1 / \ 2 2 [1,2], [1,null,2] Output: false
Example 3:
Input: 1 1 / \ / \ 2 1 1 2 [1,2,1], [1,1,2] Output: false
代码1:
/**
* 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) {
bool resultleft=false, resultright=false;
if(!p && !q){return true;}
else if(!p && q){return false;}
else if(p && !q){return false;}
else{
if(p->val != q->val){return false;}
else{
resultleft=isSameTree(p->left, q->left);
resultright=isSameTree(p->right, q->right);
}
}
return (resultleft && resultright);
}
};
代码2:
/**
* 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 false;}
if(p!=NULL && q==NULL){return false;}
if(p==NULL && q==NULL){return true;}
bool res=true;
if(p->val!=q->val){return false;}
if(p->left==NULL && q->left!=NULL){return false;}
if(p->left!=NULL && q->left==NULL){return false;}
if(p->right==NULL && q->right!=NULL){return false;}
if(p->right!=NULL && q->right==NULL){return false;}
if(p->left!=NULL && q->left!=NULL){res &= isSameTree(p->left, q->left);}
if(p->right!=NULL && q->right!=NULL){res &= isSameTree(p->right, q->right);}
return res;
}
};
代码3:
/**
* 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;
else if (p && q)
return (p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right,q->right));
else return false;
}
};