【牛客网】树的子结构

• 题目：
  输入两棵二叉树A，B，判断B是不是A的子结构。（ps：我们约定空树不是任意一个树的子结构）

• 代码：

class Solution {
public:
    bool DoesTreeHaveTree2(TreeNode* pRoot1, TreeNode* pRoot2){
          if (pRoot2 == NULL)
               return true;
          if (pRoot1 == NULL)
               return false;
          if (pRoot1->val != pRoot2->val)
               return false;
           return DoesTreeHaveTree2(pRoot1->left, pRoot2->left) && DoesTreeHaveTree2(pRoot1->right, pRoot2->right);
    }
    bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2)
    {
        bool result = false;
        if (pRoot1 != NULL && pRoot2 != NULL){
        if (pRoot1->val == pRoot2->val)
            result = DoesTreeHaveTree2(pRoot1, pRoot2);
        if (!result)
            result = HasSubtree(pRoot1->left, pRoot2);
        if (!result)
            result = HasSubtree(pRoot1->right, pRoot2);
        }
        return result;
    }//递归的思想