bool Recursive(Tree tree1, Tree tree2)
{
if (tree2 == NULL)
return true;
if (tree1 == NULL)
return false;
if (tree1->value != tree2->value)
return false;
return (Recursive(tree1->left, tree2->left) && Recursive(tree1->right, tree2->right));
}
bool IsSubstructure(Tree tree1,Tree tree2)
{
bool result = false;
if (tree1 != NULL && tree2 != NULL)
{
if (tree1->value == tree2->value)
{
result = Recursive(tree1, tree2);
}
if (!result)
{
result = IsSubstructure(tree1->left, tree2);
}
if (!result)
{
result = IsSubstructure(tree2->right, tree2);
}
}
return result;
}
二叉树的子结构
最新推荐文章于 2022-08-24 20:28:27 发布