二叉树判断是否为子结构

 

/*
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)
    {
        bool res=0;
        if(pRoot1!=NULL&&pRoot2!=NULL){
            if(pRoot1->val==pRoot2->val){
                res=issub(pRoot1,pRoot2);
            }
            if(!res){
                res=HasSubtree(pRoot1->left,pRoot2);
            }
            if(!res){
                res=HasSubtree(pRoot1->right,pRoot2);
            }
        }
        return res;
    }
    bool issub(TreeNode *r1,TreeNode *r2){
        if(r2==NULL){
            return true;
        }else if(r1==NULL){
            return false;
        }
        
        if(r1->val!=r2->val){
            return false;
        }
        return issub(r1->left,r2->left)&&issub(r1->right,r2->right);
    }
    
    
    void preorder(TreeNode *pRoot1,vector<int> &ivec)
       {
        
           if(pRoot1)
               {
                  ivec.push_back(pRoot1->val);
                  preorder(pRoot1->left,ivec);
                  preorder(pRoot1->right,ivec);
                  
           }
    }
};