题目描述
输入两颗二叉树A,B,判断B是不是A的子结构。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool judge(TreeNode* root1,TreeNode* root2){
if(root2==NULL)
return true;
if(root1==NULL&&root2)
return false;
if(root1->val!=root2->val)
return false;
return judge(root1->left,root2->left)&&judge(root1->right,root2->right);//递归判断
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot2==NULL)
return false;
else if(pRoot1==NULL&&pRoot2)
return false;
TreeNode* root;
queue<TreeNode*>q;
q.push(pRoot1);
while(!q.empty()){//层次遍历
root=q.front();
if(judge(root,pRoot2))
return true;
q.pop();
if(root->left)
q.push(root->left);
if(root->right)
q.push(root->right);
}
return false;
}
};