剑指offer JZ26 树的子结构 递归

原题链接：剑指offer JZ26 树的子结构

递归递归递归递归············

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    bool fun(TreeNode* pRoot1, TreeNode* pRoot2) 
    {
        if(pRoot2==NULL)//如果Tree2为空，则说明第二棵树遍历完了，即匹配成功
           return true;
        if(pRoot1==NULL)//如果tree1为空&&tree2不为空说明不匹配
            return false;
        if(pRoot1->val==pRoot2->val)
        {
            return (fun(pRoot1->left,pRoot2->left) && fun(pRoot1->right,pRoot2->right));
        }
        else 
            return false;
    }
    bool HasSubtree(TreeNode* pRoot1, TreeNode* pRoot2) {
          if(pRoot1==NULL || pRoot2==NULL)
              return false;
          bool res=false;
          if(pRoot1->val==pRoot2->val)
              res=fun(pRoot1,pRoot2);
          if(!res)
              res=HasSubtree(pRoot1->left,pRoot2);
          if(!res)
              res=HasSubtree(pRoot1->right,pRoot2);
           return res;
    }
};