/**
* 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&&!q) || (!p&&q)) return false;
if(!p&&!q) return true;
queue<TreeNode *> q1,q2;
q1.push(p),q2.push(q);
while(!q1.empty()&&!q2.empty())
{
TreeNode *pNode1=q1.front();
q1.pop();
TreeNode *pNode2=q2.front();
q2.pop();
if(pNode1->val!=pNode2->val) return false;
if(pNode1->left)
{
if(0==pNode2->left) return false;
if(pNode1->left->val!=pNode2->left->val) return false;
q1.push(pNode1->left);
q2.push(pNode2->left);
}
else
{
if(pNode2->left) return false;
}
if(pNode1->right)
{
if(0==pNode2->right) return false;
if(pNode1->right->val!=pNode2->right->val) return false;
q1.push(pNode1->right);
q2.push(pNode2->right);
}
else
{
if(pNode2->right) return false;
}
}
return true;
}
};
Same Tree
最新推荐文章于 2022-04-02 16:09:18 发布