剑指offer 编程题（16）：判断是否子树

题目描述

/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (!pRoot2) return false;
if (!pRoot1) return false;
return (dfs(pRoot1,pRoot2) || HasSubtree(pRoot1->left,pRoot2) || HasSubtree(pRoot1->right,pRoot2));
}
private:
bool dfs(TreeNode* pRoot1, TreeNode* pRoot2)
{
if (!pRoot2) return true;
if (!pRoot1) return false;
if (pRoot1->val == pRoot2->val) return (dfs(pRoot1->left,pRoot2->left)&&dfs(pRoot1->ri
4000
ght,pRoot2->right));
return false;
}
};