struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
bool IsInTree(TreeNode *node, TreeNode *root)
{
if(root == NULL)
return false;
if(root->val == node->val)
return true;
if(IsInTree(node, root->left))
return true;
return IsInTree(node, root->right);
}
- 判断一颗二叉树是是否是另一颗树的子树(我们约定空树不是任意一个树的子结构)tree2是tree1的子树
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
bool Subtree(TreeNode *pRoot1, TreeNode *pRoot2)
{
if(pRoot2 == NULL)
return true;
if(pRoot1 == NULL)
return false;
if(pRoot1->val != pRoot2->val)
{
return false;
}
return Subtree(pRoot1->left, pRoot2->left) && Subtree(pRoot1->right, pRoot2->right);
}
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if(pRoot1 == NULL || pRoot2 == NULL)
return false;
/*
if(pRoot1->val == pRoot2->val)
return Subtree(pRoot1, pRoot2);
if(HasSubtree(pRoot1->left, pRoot2) )
return true;
return HasSubtree(pRoot1->right, pRoot2);
*/
bool result = false;
if(pRoot1->val == pRoot2->val)
{
result = Subtree(pRoot1, pRoot2);
}
if(!result)
result = HasSubtree(pRoot1->left, pRoot2);
if(!result)
result = HasSubtree(pRoot1->right,pRoot2);
return result;
}