/*

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(pRoot1 == NULL || pRoot2 == NULL){

            return false;

        }

        return isChild(pRoot1,pRoot2)||isChild(pRoot1->left,pRoot2)||isChild(pRoot1->right,pRoot2);

    }

    bool isChild(TreeNode* root1, TreeNode* root2){

        if(root2 == NULL){

            return true;

        }

        if(root1 == NULL){

            return false;

        }

        if(root1->val == root2->val){

            return isChild(root1->left,root2->left)&&isChild(root1->right,root2->right);

        }else {

            return false;

        }

    }

};