判断一颗树是否是另外一个树的子树

struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
}
bool containsTree(TreeNode *r,TreeNode *t)
{
if(t==NULL)
return true;
return subTree(r,t);


}
bool subTree(TreeNode *r,TreeNode *t)
{
if(r==NULL)
return false;
if(r->val==t->val){
if(matchTree(r,t))
return true;
}
return subTree(r->left,t)||subTree(r->right,t);
}
//两个树是否相等
bool matchTree(TreeNode *r,TreeNode *t)
{
if(r==NULL&&t==NULL)
return true;
if(r==NULL||t==NULL)
return false;
if(t->val!=r->val)
return false;
else return matchTree(r->left,t->left)&&matchTree(r->right,t->right);


}