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

# -*- coding:utf-8 -*-
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
class Solution:
    def HasSubtree(self, pRoot1, pRoot2):
        # write code here
        if pRoot2 == None: return False
        if pRoot1 == None: return False
        
        flag = False
        if pRoot1.val == pRoot2.val:
            flag = self.doesTree1HaveTree2(pRoot1, pRoot2)
        if not flag:
            flag = self.HasSubtree(pRoot1.left, pRoot2)
        if not flag:
            flag = self.HasSubtree(pRoot1.right, pRoot2)
            
        return flag
        
    def doesTree1HaveTree2(self, pRoot1, pRoot2):
        if pRoot2 == None: return True
        if pRoot1 == None: return False
        if pRoot1.val != pRoot2.val: return False
        return self.doesTree1HaveTree2(pRoot1.left, pRoot2.left) and self.doesTree1HaveTree2(pRoot1.right, pRoot2.right)