# -*- 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 pRoot1==None or pRoot2==None: return False
return self.isSubtree(pRoot1,pRoot2) or self.HasSubtree(pRoot1.left,pRoot2) or self.HasSubtree(pRoot1.right,pRoot2)
def isSubtree(self,A,B):
#B,A的逻辑判断顺序不能颠倒,否则错误
if B==None:return True
if A==None or A.val != B.val:return False
return self.isSubtree(A.left,B.left) and self.isSubtree(A.right,B.right)