struct BinaryTreeNode
{
int val;
BinaryTreeNode* left;
BinaryTreeNode* right;
};
一、判断二叉树B是不是A的子树
bool DoseTree1HasTree2(BinaryTreeNode* pRoot1,BinaryTreeNode* pRoot2)
{
if(pRoot2==NULL)
return true;
if(pRoot1==NULL)
return false;
if(pRoot1->val!=pRoot2->val)
return false;
return DoseTree1HasTree2(pRoot1->left,pRoot2->right)&&DoseTree1HasTree2(pRoot1->right,pRoot2->right);
}