题目描述
输入两棵二叉树A,B,判断B是不是A的子结构。(ps:我们约定空树不是任意一个树的子结构)
-
struct TreeNode {
-
double val;
-
struct TreeNode *left;
-
struct TreeNode *right;
-
};
解答:
//判断两个结点的值是否相等,注意是double型
bool Equal(double num1,double num2)
{
if(num1-num2>-0.0000001&&num1-num2<0.0000001)
return true;
else
return false;
}
//判断树1中是否存在和树b根节点值一样的节点
bool HasSubtree(TreeNode* pRoot1,TreeNode* pRoot2)
{
bool result=false;
if(pRoot1!=NULL&&pRoot2!=NULL)
{
if(Equal(pRoot1->val,pRoot2->val))
result = DoesTree1HaveTree2(pRoot1,pRoot2);
if(!result)
HasSubtree(pRoot1->left,pRoot2)
if(!result)
HasSubtree(pRoot2->right,pRoot2)
}
return result;
}
//判断树1中以pRoot1为根节点得子树是不是包含树2一样的结构
bool DoesTree1HaveTree2(TreeNode* pRoot1,TreeNode* pRoot2)
{
if(pRoot2==NULL)
return true;
if(pRoot1==NULL)
return false;
if(!Equal(pRoot1->val,pRoot2->val))
return false;
return DoesTree1HaveTree2(pRoot1->left,pRoot2->left)&&DoesTree1HaveTree2(pRoot1->right,pRoot2->right);//递归
}