/*
面试题18:树的子结构
:输入两棵二叉树A和B,判断B是不是A的子结构,
*/
/*
解题思路:
**对树的遍历采取递归的方式
1.先在树A中查找和B的根节点的值一样的结点R
2.判断树A中以R为根节点的子树是不是包含和树B一样的结构
如果结点R的值和树B的根节点不相同,则以R为根结点的子树和树B肯定不具有相同的节点,
如果它们的值相同,则递归判断它们各自的左右结点的值是不是相同。
*/
struct BinaryTreeNode
{
int m_nValue;
BinaryTreeNode* m_pLeft;
BinaryTreeNode* m_pRight;
};
BinaryTreeNode* Create()
{
BinaryTreeNode *pRoot;
int data;
cin>>data;
if(data ==0)
{
pRoot = NULL;
}
else
{
pRoot = new BinaryTreeNode;
pRoot->m_nValue = data;
pRoot->m_pLeft = Create( );
pRoot->m_pRight = Create( );
}
return pRoot;
}
void PreOrder(BinaryTreeNode* pRoot)
{
if(pRoot)
{
cout<<pRoot->m_nValue <<" ";
PreOrder(pRoot->m_pLeft );
PreOrder(pRoot->m_pRight );
}
}
//判断树A中以R为根节点的子树是不是和树B具有相同的结构
bool DoseTree1HaveTree2(BinaryTreeNode *pRoot1,BinaryTreeNode* pRoot2)
{
//证明Tree2已经遍历结束,匹配成功
if(pRoot2 == NULL)
{
return true;
}
//证明Tree1已经遍历结束,匹配失败
if(pRoot1 == NULL)
{
return false;
}
if(pRoot1->m_nValue !=pRoot2->m_nValue )
return false;
//递归遍历各自的左右结点的值是否相同
return DoseTree1HaveTree2(pRoot1->m_pLeft ,pRoot2->m_pLeft )&&
DoseTree1HaveTree2(pRoot1->m_pRight ,pRoot2->m_pRight );
}
//查找与根节点的值一样的结点
bool HasSubTree(BinaryTreeNode* pRoot1,BinaryTreeNode* pRoot2)
{
bool result = false;
if(pRoot1 != NULL && pRoot2 != NULL)
{
//判断根节点
if(pRoot1->m_nValue == pRoot2->m_nValue )
result = DoseTree1HaveTree2(pRoot1,pRoot2);
//从根节点的左子树开始匹配Tree2
if(!result)
result = HasSubTree(pRoot1->m_pLeft,pRoot2);
//如果左子树没有匹配成功则继续在右子树种匹配Tree2
if(!result)
result = HasSubTree(pRoot1->m_pRight ,pRoot2);
}
return result;
}
int main()
{
BinaryTreeNode* pRoot1 = NULL;
BinaryTreeNode* pRoot2 = NULL;
cout<<"First Tree A is:"<<endl;
pRoot1 = Create();
cout<<"先序遍历:";
PreOrder(pRoot1);
cout<<endl;
cout<<"First Tree B is:"<<endl;
pRoot2 = Create();
cout<<"先序遍历:";
PreOrder(pRoot2);
cout<<endl;
if(HasSubTree(pRoot1,pRoot2))
{
cout<<"树A包含树B"<<endl;
}
else
{
cout<<"树A不包含树B"<<endl;
}
return 0;
}