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
判断两棵树是否相等。
方法一:递归
/**
* 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(p->val !=q->val)
return false;
return isSameTree(p->left, q->left) && isSameTree(p->right, q->right);
}
};
方法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)
{
queue<TreeNode*> nodes;
nodes.push(p);
nodes.push(q);
while(!nodes.empty())
{
int len = nodes.size();
while(len)
{
TreeNode* nodeL = nodes.front();
nodes.pop();
TreeNode* nodeR = nodes.front();
nodes.pop();
len=len-2;
if(nodeL && nodeR)
{
if(nodeL->val != nodeR->val)
return false;
}
else if(!nodeL && !nodeR)
{
continue;
}
else
{
return false;
}
nodes.push(nodeL->left);
nodes.push(nodeR->left);
nodes.push(nodeL->right);
nodes.push(nodeR->right);
}
}
return true;
}
};