树的子结构

最新推荐文章于 2022-04-20 20:23:54 发布

午后小夕

最新推荐文章于 2022-04-20 20:23:54 发布

阅读量452

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/wangfengfan1/article/details/46805897

版权

剑指offer 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

bool HasSubtree(BinaryTreeNode* pRoot1, BinaryTreeNode*pRoot2)
{
bool result = false;
if (pRoot1 != NULL&&pRoot2 != NULL)
{
if (pRoot1->m_nValue == pRoot2->m_nValue)
{
result = DoesTreeHaveTree2(pRoot1, pRoot2);
}
if (!result)
result = HasSubtree(pRoot1->m_pLeft,pRoot2);
if (!result)
result = HasSubtree(pRoot1->m_pRight, pRoot2);
}
return result;
}

bool DesTree1HaveTree2(BinaryTreeNode* pRoot1, BinaryTreeNode* pRoot2)
{
if (pRoot2 == NULL)
return true;
if (pRoot1 == NULL)
return false;
if (pRoot1->m_nValue != pRoot2->m_nValue)
return false;
return DesTree1HaveTree2(pRoot1->m_pLeft, pRoot2->m_pLeft) && DesTree1HaveTree2(pRoot1->m_pRight, pRoot2->m_pRight);
}